Automatic enumeration of all connected subgraphs.
Publikation: Beiträge in Zeitschriften › Zeitschriftenaufsätze › Forschung › begutachtet
Standard
Automatic enumeration of all connected subgraphs. / Rücker, Gerta; Rücker, Christoph.
in: MATCH Communications in mathematical and in computer chemistry, Jahrgang 41, 03.2000, S. 145-149.Publikation: Beiträge in Zeitschriften › Zeitschriftenaufsätze › Forschung › begutachtet
Harvard
APA
Vancouver
Bibtex
}
RIS
TY - JOUR
T1 - Automatic enumeration of all connected subgraphs.
AU - Rücker, Gerta
AU - Rücker, Christoph
PY - 2000/3
Y1 - 2000/3
N2 - A computer program for generating all connected subgraphs of a connected undirected simple graph is introduced, which is based on a path-tracing algorithm in the graph's edge adjacency matrix.
AB - A computer program for generating all connected subgraphs of a connected undirected simple graph is introduced, which is based on a path-tracing algorithm in the graph's edge adjacency matrix.
KW - Mathematics
UR - http://www.scopus.com/inward/record.url?scp=0000443217&partnerID=8YFLogxK
M3 - Journal articles
VL - 41
SP - 145
EP - 149
JO - Match
JF - Match
SN - 0340-6253
ER -