Automatic enumeration of all connected subgraphs.
Research output: Journal contributions › Journal articles › Research › peer-review
Standard
In: MATCH Communications in mathematical and in computer chemistry, Vol. 41, 03.2000, p. 145-149.
Research output: Journal contributions › Journal articles › Research › peer-review
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 Communications in mathematical and in computer chemistry
JF - MATCH Communications in mathematical and in computer chemistry
ER -