Depth-First Search and Kuratowski Subgraphs
From MaRDI portal
Publication:3769978
DOI10.1145/1634.322451zbMath0632.68063WikidataQ56092455 ScholiaQ56092455MaRDI QIDQ3769978
Publication date: 1984
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1634.322451
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
Related Items
Obstructions for the Disk and the Cylinder Embedding Extension Problems, Canonical forms for cycles in bridge graphs, Efficient Extraction of Multiple Kuratowski Subdivisions, Outer 1-planar graphs, Linkless and flat embeddings in 3-space, Certifying algorithms, Projective plan and Möbius band obstructions, Approximation algorithms for classes of graphs excluding single-crossing graphs as minors, On the embedding phase of the Hopcroft and Tarjan planarity testing algorithm, A new planarity test, Unnamed Item, Menus of kuratowski subgraphs, Searching forK3,3in linear time