The minimal size of a graph with given generalized 3-edge-connectivity.
Xueliang LiYaping MaoPublished in: Ars Comb. (2015)
Keyphrases
- weighted graph
- connected components
- strongly connected
- disjoint paths
- maximum clique
- undirected graph
- random walk
- structured data
- edge map
- graph connectivity
- vertex set
- topological information
- graph clustering
- graph representation
- graph theory
- bipartite graph
- bayesian networks
- data sets
- graph databases
- edge weights
- edge information
- graph structures
- maximal cliques
- bounded treewidth
- graph model
- graph based algorithm
- directed graph
- edge detection