Good Quality Virtual Realization of Unit Ball Graphs
From MaRDI portal
Publication:3527222
DOI10.1007/978-3-540-75520-3_29zbMath1151.05333OpenAlexW2163185222MaRDI QIDQ3527222
Imran A. Pirwani, Sriram V. Pemmaraju
Publication date: 25 September 2008
Published in: Algorithms – ESA 2007 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-75520-3_29
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (3)
A weakly robust PTAS for minimum clique partition in unit disk graphs ⋮ Shifting strategy for geometric graphs without geometry ⋮ A note on maximum independent sets and minimum clique partitions in unit disk graphs and penny graphs: complexity and approximation
This page was built for publication: Good Quality Virtual Realization of Unit Ball Graphs