Algorithmus 41. Ein Algorithmus zum vollständigen Durchlaufen eines ungerichteten, zusammenhängenden Graphen

DOI10.1007/BF02281731MaRDI QIDQ1139941zbMATH OpenFDO

Authors K.-P. Kugler, U. Pape

Publication date 1980

Published in Computing (Search for Journal in Brave)

zbMATH Keywords

algorithm for the traversal of an undirected connected graphprinciple of the thread of Ariadne

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

This page was built for publication: Algorithmus 41. Ein Algorithmus zum vollständigen Durchlaufen eines ungerichteten, zusammenhängenden Graphen

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1139941)