On Linear Time Minor Tests with Depth-First Search
From MaRDI portal
Publication:4033754
DOI10.1006/jagm.1993.1001zbMath0764.68107WikidataQ56639266 ScholiaQ56639266MaRDI QIDQ4033754
Publication date: 16 May 1993
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jagm.1993.1001
dynamic programming; cycle; path; grid graph; graph minors; depth- first search; circus graph; linear time minor tests
90C35: Programming involving graphs or networks
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
05C38: Paths and cycles
Related Items
A new algorithm for minimum spanning tree using depth-first-search in an undirected graph, A partial k-arboretum of graphs with bounded treewidth, On interval routing schemes and treewidth