Towards minimumk-geodetically connected graphs
From MaRDI portal
Publication:4804165
DOI10.1002/net.10060zbMath1014.05022OpenAlexW1499566842MaRDI QIDQ4804165
Publication date: 10 April 2003
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.10060
Related Items (4)
Minimumk-geodetically connected digraphs ⋮ Minimum 3-geodetically connected graphs ⋮ Some special minimum \(k\)-geodetically connected graphs ⋮ An efficient distributed algorithm for finding all hinge vertices in networks
Cites Work
- The recognition of geodetically connected graphs
- Disjoint shortest paths in graphs
- Minimum self-repairing graphs
- Recognizing hinge-free line graphs and total graphs
- Design of Communication Networks with Survivability Constraints
- Minimumk-geodetically connected digraphs
- Geodetic connectivity of graphs
- On the hardness of approximating spanners
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Towards minimumk-geodetically connected graphs