Edge-disjoint spanners of complete graphs and complete digraphs
From MaRDI portal
Publication:1301660
DOI10.1016/S0012-365X(99)00012-6zbMath0932.05028MaRDI QIDQ1301660
Thomas C. Shermer, Christian Laforest, Arthur L. Liestman, Dominique Sotteau, David Peleg
Publication date: 20 December 1999
Published in: Discrete Mathematics (Search for Journal in Brave)
Extremal problems in graph theory (05C35) Distance in graphs (05C12) Directed graphs (digraphs), tournaments (05C20)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Spanners of underlying graphs of iterated line digraphs
- A Hamiltonian decomposition of \(K^*_{2m},2m\geq 8\)
- On sparse spanners of weighted graphs
- NP-completeness of minimum spanner problems
- Isomorphic tree spanner problems
- Degree-constrained spanners for multidimensional grids
- Disjoint factors of diameter two in complete graphs
- Graph spanners
- Generating Low-Degree 2-Spanners
- Near-Linear Time Construction of Sparse Neighborhood Covers
- Spanners in graphs of bounded degree
- Generating Sparse 2-Spanners
- NEW SPARSENESS RESULTS ON GRAPH SPANNERS
- An Optimal Synchronizer for the Hypercube
- Degree-Constrained Network Spanners with Nonconstant Delay
- Tree Spanners
- Spanners of Hypercube-Derived Networks
- All-Pairs Almost Shortest Paths
- Grid spanners
- Additive graph spanners
- Edge-disjoint spanners of complete bipartite graphs
