Automatic enumeration of all connected subgraphs.
Research output: Journal contributions › Journal articles › Research › peer-review
Authors
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.
| Translated title of the contribution | Automatische Aufzählung aller zusammenhängenden Subgraphen. |
|---|---|
| Original language | English |
| Journal | MATCH Communications in mathematical and in computer chemistry |
| Volume | 41 |
| Pages (from-to) | 145-149 |
| Number of pages | 5 |
| Publication status | Published - 03.2000 |
| Externally published | Yes |
- Mathematics