On removable edges in 3-connected cubic graphs.
Jean-Luc FouquetHenri ThuillierPublished in: Discret. Math. (2012)
Keyphrases
- directed graph
- real world graphs
- connected components
- undirected graph
- weighted graph
- spanning tree
- massive graphs
- spectral embedding
- edge weights
- graph mining
- connected graphs
- neighborhood graph
- graph theoretic
- nodes of a graph
- subgraph isomorphism
- graph partitioning
- edge information
- directed acyclic graph
- bipartite graph
- b spline
- graph representation
- graph structure
- graph clustering
- graph theory
- vertex set
- graph matching
- edge detector
- random walk
- directed edges
- clustering algorithm