Minimum edge cuts in diameter 2 graphs.
Allan BickleAllen J. SchwenkPublished in: Discuss. Math. Graph Theory (2019)
Keyphrases
- weighted graph
- maximum distance
- spanning tree
- undirected graph
- vertex set
- minimum spanning trees
- edge information
- edge weights
- edge detector
- graph theory
- adjacency graph
- average degree
- minimum cost
- graph mining
- edge detection
- series parallel
- graph databases
- random graphs
- graph representation
- graph partitioning
- connected dominating set
- objective function
- subgraph isomorphism
- graph model
- bipartite graph
- pattern recognition