Chapter 7. Connectivity
From MaRDI portal
Recommendations
Cited in
(6)- Maximum weight relaxed cliques and Russian doll search revisited
- Finding maximum subgraphs with relatively large vertex connectivity
- On the radius of centrality in evolving communication networks
- A Branch-and-Price Framework for Decomposing Graphs into Relaxed Cliques
- Probabilistic properties of highly connected random geometric graphs
- The cactus tree of a metric space
This page was built for publication: Chapter 7. Connectivity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5703982)