scientific article; zbMATH DE number 6851889
From MaRDI portal
Publication:4608619
DOI10.4230/LIPIcs.MFCS.2016.56zbMath1398.05201arXiv1606.04679MaRDI QIDQ4608619
Moritz Laudahn, Frank Kammer, Dieter Kratsch
Publication date: 21 March 2018
Full work available at URL: https://arxiv.org/abs/1606.04679
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40)
Related Items (7)
Space-efficient Euler partition and bipartite edge coloring ⋮ Space-efficient biconnected components and recognition of outerplanar graphs ⋮ Extra Space during Initialization of Succinct Data Structures and Dynamical Initializable Arrays. ⋮ Frameworks for designing in-place graph algorithms ⋮ A Framework for In-place Graph Algorithms ⋮ Space-efficient DFS and applications to connectivity problems: simpler, leaner, faster ⋮ Space efficient linear time algorithms for BFS, DFS and applications
This page was built for publication:
