Linear-Time Algorithms for Hole-Free Rectilinear Proportional Contact Graph Representations

DOI10.1007/978-3-642-25591-5_30zbMath1350.68206WikidataQ56689778 ScholiaQ56689778MaRDI QIDQ3104623

Stefan Felsner, Therese C. Biedl, Md. Jawaherul Alam, Michael Kaufmann, Stephen G. Kobourov, Andreas Gerasch

Publication date: 16 December 2011

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-25591-5_30

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68R10: Graph theory (including graph drawing) in computer science

68U05: Computer graphics; computational geometry (digital and algorithmic aspects)

05C85: Graph algorithms (graph-theoretic aspects)

05C62: Graph representations (geometric and intersection representations, etc.)

Related Items

Computing cartograms with optimal complexity, Linear-time algorithms for hole-free rectilinear proportional contact graph representations