Contractible Edges in a 4-Connected Graph with Vertices of Degree Greater Than Four.
Kiyoshi AndoYoshimi EgawaPublished in: Graphs Comb. (2007)
Keyphrases
- weighted graph
- undirected graph
- edge weights
- directed edges
- directed graph
- vertex set
- random graphs
- connected components
- connected graphs
- spanning tree
- minimum weight
- adjacency matrix
- directed acyclic graph
- maximum matching
- shortest path
- bipartite graph
- graph structure
- graph model
- labeled graphs
- strongly connected
- real world graphs
- approximation algorithms
- graph partitioning
- graph clustering
- planar graphs
- random walk
- average degree
- stable set
- graph theoretic
- graph representation
- graph structures
- hamiltonian cycle
- densely connected
- edge detector
- clustering coefficient
- graph construction
- minimum cost
- diffusion process