Tree \(t\)-spanners in outerplanar graphs via supply demand partition
From MaRDI portal
Publication:496441
DOI10.1016/j.dam.2014.11.001zbMath1320.05027arXiv1210.7919OpenAlexW2964285712MaRDI QIDQ496441
G. Ramakrishna, N. S. Narayanaswamy
Publication date: 21 September 2015
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1210.7919
Trees (05C05) Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (5)
Parameterized Minimum Cost Partition of a Tree with Supply and Demand ⋮ Tree spanners of bounded degree graphs ⋮ Partition on trees with supply and demand: kernelization and algorithms ⋮ A mixed integer program for partitioning graphs with supply and demand emphasizing sparse graphs ⋮ A heuristic method for solving the problem of partitioning graphs with supply and demand
Cites Work
- Unnamed Item
- Reconstructing the shape of a tree from observed dissimilarity data
- Spanners in sparse graphs
- Tree 3-spanners on interval, permutation and regular bipartite graphs
- Tree spanners for bipartite graphs and probe interval graphs
- Characterizations of outerplanar graphs
- Tree spanners on chordal graphs: complexity and algorithms
- On the embedding phase of the Hopcroft and Tarjan planarity testing algorithm
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Approximation of pathwidth of outerplanar graphs
- Approximation algorithms for NP-complete problems on planar graphs
- Additive Tree Spanners
- Distributed Computing: A Locality-Sensitive Approach
- Tree Spanners
- A Practical Approach to Courcelle's Theorem
- Tree spanners in planar graphs
This page was built for publication: Tree \(t\)-spanners in outerplanar graphs via supply demand partition
