Space efficient algorithms for some graph theoretical problems
From MaRDI portal
Publication:1160148
DOI10.1007/BF00264160zbMath0477.05060MaRDI QIDQ1160148
Publication date: 1982
Published in: Acta Informatica (Search for Journal in Brave)
deterministic algorithms; planarity testing; minimum cost spanning trees; producing a plane embedding
05C10: Planar graphs; geometric and topological aspects of graph theory
05C99: Graph theory
68W99: Algorithms in computer science
Related Items
Combinatorial analysis (nonnegative matrices, algorithmic problems), The complexity of planarity testing, Planarity Testing Revisited