Finding Maximal Sets of Laminar 3-Separators in Planar Graphs in Linear Time

DOI10.1137/1.9781611975482.37zbMath1431.68092arXiv1810.07825OpenAlexW2897704917MaRDI QIDQ5236218

No author found.

Publication date: 15 October 2019

Published in: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40)

Related Items (3)

Quasipolynomiality of the Smallest Missing Induced Subgraph ⋮ Outerspatial 2-complexes: extending the class of outerplanar graphs to three dimensions ⋮ NC Algorithms for Computing a Perfect Matching and a Maximum Flow in One-Crossing-Minor-Free Graphs

This page was built for publication: Finding Maximal Sets of Laminar 3-Separators in Planar Graphs in Linear Time