The maximal size of graphs with at most k edge-disjoint paths connecting any two adjacent vertices.
Mao-cheng CaiPublished in: Discret. Math. (1990)
Keyphrases
- disjoint paths
- undirected graph
- directed graph
- approximation algorithms
- connected components
- directed acyclic graph
- random graphs
- spanning tree
- maximal cliques
- graph structure
- complex networks
- adjacency matrix
- weighted graph
- directed edges
- minimum cost
- average degree
- strongly connected
- vertex set
- independent set
- edge weights
- binary images
- probabilistic model
- labeled graphs
- special case
- bayesian networks