Recognizing map graphs of bounded treewidth
From MaRDI portal
Publication:6182682
DOI10.1007/s00453-023-01180-6arXiv2206.14898OpenAlexW4388188757MaRDI QIDQ6182682
Fabrizio Montecchiani, Giordano Da Lozzo, Patrizio Angelini, Martin Gronemann, Alessandra Tappini, Michael A. Bekos
Publication date: 25 January 2024
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2206.14898
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fixed-parameter algorithms for cluster vertex deletion
- Treewidth. Computations and approximations
- Linear-time recognition of map graphs with outerplanar witness
- Characterizing and recognizing 4-map graphs
- Orthogonal planarity testing of bounded treewidth graphs
- Characterizing 5-map graphs by 2-fan-crossing graphs
- Deleting vertices to graphs of bounded genus
- Handle-rewriting hypergraph grammars
- Recognizing hole-free 4-map graphs in cubic time
- Map graphs having witnesses of large girth
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Approximation Algorithms for Independent Sets in Map Graphs
- Fixed-parameter algorithms for ( k , r )-center in planar graphs and map graphs
- Map graphs
- New bounds on the edge number of ak-map graph
- Graph minors. II. Algorithmic aspects of tree-width
- A New Algorithm for Generating All the Maximal Independent Sets
- Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs
- Decomposition of Map Graphs with Applications.
- Planar Graphs Have Bounded Queue-Number
- Structure of Graphs with Locally Restricted Crossings
- Intersection-Link Representations of Graphs
- A Near-Optimal Planarization Algorithm
- Parameterized Algorithms
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- Hardness and structural results for half-squares of restricted tree convex bipartite graphs
This page was built for publication: Recognizing map graphs of bounded treewidth
