Removable edges in a cycle of a 4-connected graph.
Jichang WuXueliang LiLusheng WangPublished in: Discret. Math. (2004)
Keyphrases
- directed graph
- weighted graph
- connected components
- directed acyclic graph
- undirected graph
- spanning tree
- edge weights
- neighborhood graph
- maximum matching
- vertex set
- graph theory
- directed edges
- random walk
- graph representation
- graph structure
- bipartite graph
- graph model
- real world graphs
- spectral embedding
- connected graphs
- graph mining
- graph partitioning
- structured data
- massive graphs
- nodes of a graph
- edge information
- graphical representation
- graph matching
- edge detector
- image processing