Properly 3-contractible edges in a minimally 3-connected graph.
Kiyoshi AndoYoshimi EgawaPublished in: Discret. Math. (2023)
Keyphrases
- directed graph
- weighted graph
- connected components
- spanning tree
- undirected graph
- spectral embedding
- edge weights
- real world graphs
- vertex set
- graph model
- directed acyclic graph
- directed edges
- structured data
- graph representation
- graph structure
- nodes of a graph
- random walk
- neighborhood graph
- bipartite graph
- graph matching
- massive graphs
- connected graphs
- graph mining
- graph theory
- maximum matching
- graph theoretic
- graph clustering
- graph construction
- stable set
- edge detector
- strongly connected components