Non-Contractible Edges in A 3-Connected Graph.
Yoshimi EgawaKatsuhiro OtaAkira SaitoXingxing YuPublished in: Comb. (1995)
Keyphrases
- directed graph
- weighted graph
- connected components
- spanning tree
- undirected graph
- directed acyclic graph
- spectral embedding
- edge weights
- real world graphs
- random walk
- vertex set
- neighborhood graph
- graph structure
- graph based algorithm
- graph representation
- edge information
- graph mining
- graph theory
- massive graphs
- directed edges
- nodes of a graph
- graph model
- bipartite graph
- graph construction
- graph theoretic
- edge detector
- shortest path