Polynomial algorithms for sparse spanners on subcubic graphs
From MaRDI portal
Recommendations
Cites work
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- A trade-off between space and efficiency for routing tables
- An approximation algorithm for the tree \(t\)-spanner problem on unweighted graphs via generalized chordal graphs
- An Optimal Synchronizer for the Hypercube
- Approximate distance oracles
- Approximate distance oracles for unweighted graphs in expected \(O(n^2)\) time
- Complexity of network synchronization
- Edge tree spanners
- Graph spanners
- Graph spanners: a tutorial review
- Graph structure and monadic second-order logic. A language-theoretic approach
- Hardness and efficiency on \(t\)-admissibility for graph operations
- Improved NP-hardness results for the minimum \(t\)-spanner problem on bounded-degree graphs
- Linear Programming
- Minimum \(t\)-spanners on subcubic graphs
- Mixed-integer programming approaches for the tree \(t^*\)-spanner problem
- NP-completeness of minimum spanner problems
- NP-hardness and fixed-parameter tractability of the minimum spanner problem
- Optimality computation of the minimum stretch spanning tree problem
- Restrictions of minimum spanner problems
- Spanners in graphs of bounded degree
- Spanners in sparse graphs
- Spanners of bounded degree graphs
- Tree 3-spanners on generalized prisms of graphs
- Tree Spanners
- Tree spanners for bipartite graphs and probe interval graphs
- Tree spanners in planar graphs
- Tree spanners of bounded degree graphs
This page was built for publication: Polynomial algorithms for sparse spanners on subcubic graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6621853)
