Bounded Length, 2-Edge Augmentation of Geometric Planar Graphs
DOI10.1007/978-3-642-17458-2_31zbMath1310.68025OpenAlexW2127275321MaRDI QIDQ3066172
Ladislav Stacho, Oscar Morales-Ponce, Evangelos Kranakis, Danny Krizanc
Publication date: 8 January 2011
Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-17458-2_31
augmentationplanar graphsgeometric graphsdeletion2-edge connectedunit disk graphsminimum number of edges
Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Reliability, testing and fault tolerance of networks and computer systems (68M15) Connectivity (05C40)
Related Items (1)
This page was built for publication: Bounded Length, 2-Edge Augmentation of Geometric Planar Graphs
