Lower Bound on the Number of Contractible Edges in a 4-Connected Graph with Edges Not Contained in Triangles.
Yoshimi EgawaKeiko KotaniShunsuke NakamuraPublished in: Graphs Comb. (2018)
Keyphrases
- directed graph
- undirected graph
- lower bound
- nodes of a graph
- connected components
- spanning tree
- small number
- massive graphs
- edge weights
- weighted graph
- directed edges
- upper bound
- connected graphs
- random walk
- directed acyclic graph
- edge information
- objective function
- approximation algorithms
- graph matching
- computational complexity