Efficient reassembling of three-regular planar graphs

DOI10.1007/s10878-020-00555-7zbMath1442.05045arXiv1807.03479OpenAlexW3009672828MaRDI QIDQ2175057

Benjamin Sisson, A. J. Kfoury

Publication date: 27 April 2020

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1807.03479

zbMATH Keywords

planar graphsrouting treegraph carvinggraph reassemblingthree-regular graphs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85)

Uses Software

• Algorithm 447

Cites Work

• Unnamed Item
• Disjoint paths in sparse graphs
• Call routing and the ratcatcher
• Why should biconnected components be identified first
• Efficient reassembling of graphs. I: The linear case
• Determining the Smallest k Such That G Is k-Outerplanar
• Optimal branch-decomposition of planar graphs in O ( n ³ ) Time

This page was built for publication: Efficient reassembling of three-regular planar graphs