Space efficient algorithms for some graph theoretical problems

DOI10.1007/BF00264160zbMath0477.05060OpenAlexW2077095124MaRDI QIDQ1160148

Janos Simon, Joseph F. Ja'Ja'

Publication date: 1982

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00264160

zbMATH Keywords

deterministic algorithmsplanarity testingminimum cost spanning treesproducing a plane embedding

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph theory (05C99) Algorithms in computer science (68W99)

Related Items (3)

The complexity of planarity testing ⋮ Planarity Testing Revisited ⋮ Combinatorial analysis (nonnegative matrices, algorithmic problems)

This page was built for publication: Space efficient algorithms for some graph theoretical problems