The Minimum Number of Edges and Vertices in a Graph with Edge Connectivity n and m n-Bonds.
Robert E. BixbyPublished in: Networks (1975)
Keyphrases
- undirected graph
- weighted graph
- edge weights
- spanning tree
- directed edges
- connected components
- random graphs
- bipartite graph
- vertex set
- edge detector
- directed graph
- minimum cost
- directed acyclic graph
- edge information
- approximation algorithms
- constant factor
- strongly connected
- disjoint paths
- structured data
- nodes of a graph