Treelength of series-parallel graphs
From MaRDI portal
Publication:6069145
DOI10.1016/j.dam.2023.07.022zbMath1526.05114OpenAlexW3102007657MaRDI QIDQ6069145
Thomas Dissaux, Nicolas Nisse, Guillaume Ducoffe, Simon Nivelle
Publication date: 13 November 2023
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2023.07.022
Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distance in graphs (05C12) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (1)
Cites Work
- Approximate tree decompositions of planar graphs in linear time
- An approximation algorithm for the tree \(t\)-spanner problem on unweighted graphs via generalized chordal graphs
- \(k\)-chordal graphs: from cops and robber to compact routing via treewidth
- Monadic second-order evaluations on tree-decomposable graphs
- On the complexity of computing treelength
- Parallel recognition of series-parallel graphs
- S-functions for graphs
- Call routing and the ratcatcher
- On the complexity of computing treebreadth
- Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth
- Tree-decompositions with bags of small diameter
- On the Tree-Width of Planar Graphs
- (Meta) Kernelization
- Improved Approximation Algorithms for Minimum Weight Vertex Separators
- Graph minors. II. Algorithmic aspects of tree-width
- Complexity of Finding Embeddings in a k-Tree
- The Recognition of Series Parallel Digraphs
- Algorithmic Aspects of Vertex Elimination on Graphs
- Revisiting Decomposition by Clique Separators
- Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs
- 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS)
- Metric Dimension of Bounded Tree-length Graphs
- Parameterized Algorithms
- To Approximate Treewidth, Use Treelength!
This page was built for publication: Treelength of series-parallel graphs
