Automatic enumeration of all connected subgraphs.

Gerta Rücker; Christoph Rücker

Automatic enumeration of all connected subgraphs.

Titel in Übersetzung: Automatische Aufzählung aller zusammenhängenden Subgraphen.

Gerta Rücker
, Christoph Rücker

Albert-Ludwigs-Universität Freiburg

Publikation: Beiträge in Zeitschriften › Zeitschriftenaufsätze › Forschung › Begutachtung

18 Zitate (Scopus)

Abstract

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.

Titel in Übersetzung	Automatische Aufzählung aller zusammenhängenden Subgraphen.
Originalsprache	Englisch
Zeitschrift	MATCH Communications in mathematical and in computer chemistry
Jahrgang	41
Seiten (von - bis)	145-149
Seitenumfang	5
Publikationsstatus	Erschienen - 03.2000
Extern publiziert	Ja

Fachgebiete und Schlagwörter

Mathematik

ASJC Scopus Sachgebiete

Angewandte Mathematik
Theoretische Informatik und Mathematik
Chemie (insg.)
Angewandte Informatik

Zugriff auf Dokument

http://match.pmf.kg.ac.rs/electronic_versions/Match41/match41_145-149.pdfLizenz: Urheberrechtlich geschützt

Dieses zitieren

@article{b766e46924d44e648ef43f00567d61bb,

title = "Automatic enumeration of all connected subgraphs.",

abstract = "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.",

keywords = "Mathematics",

author = "Gerta R{\"u}cker and Christoph R{\"u}cker",

year = "2000",

month = mar,

language = "English",

volume = "41",

pages = "145--149",

journal = "MATCH Communications in mathematical and in computer chemistry",

publisher = "University of Kragujevac, Faculty of Science",

}

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 - https://www.scopus.com/pages/publications/0000443217

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 -

Automatic enumeration of all connected subgraphs.

Abstract

Fachgebiete und Schlagwörter

ASJC Scopus Sachgebiete

Zugriff auf Dokument

Fingerprint

Dieses zitieren