Connectivity check in 3-connected planar graphs with obstacles

DOI10.1016/j.endm.2008.06.030zbMath1267.05155OpenAlexW2043204450MaRDI QIDQ5300999

Cyril Gavoille, Mamadou Moustapha Kanté, Andrew Twigg, Bruno Courcelle

Publication date: 28 June 2013

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.136.2354

zbMATH Keywords

connectivityplanar graphobstaclescompact labelling scheme

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Connectivity (05C40)

Related Items (3)

Efficient First-Order Model-Checking Using Short Labels ⋮ Compact labelings for efficient first-order model-checking ⋮ Constrained-path labellings on graphs of bounded clique-width

Cites Work

• Unnamed Item
• Unnamed Item
• How to draw a planar graph on a grid
• Query efficient implementation of graphs of bounded clique-width
• Compact Forbidden-Set Routing
• Compact and localized distributed data structures
• Compact oracles for reachability and approximate distances in planar digraphs
• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science

This page was built for publication: Connectivity check in 3-connected planar graphs with obstacles