Automatic enumeration of all connected subgraphs.

Research output: Journal contributionsJournal articlesResearchpeer-review


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 contributionAutomatische Aufzählung aller zusammenhängenden Subgraphen.
Original languageEnglish
JournalMATCH Communications in mathematical and in computer chemistry
Pages (from-to)145-149
Number of pages5
Publication statusPublished - 03.2000
Externally publishedYes