Upon the removal of the edges of a 1-factor from an even circuit in a 2-connected graph.
Philip A. SinclairPublished in: Discret. Math. (2004)
Keyphrases
- directed graph
- weighted graph
- connected components
- undirected graph
- directed acyclic graph
- spanning tree
- real world graphs
- edge weights
- graph structure
- random walk
- neighborhood graph
- connected graphs
- graph representation
- nodes of a graph
- high speed
- spectral embedding
- graph matching
- massive graphs
- strongly connected
- maximum matching
- electronic circuits
- vertex set
- graph theoretic
- logic circuits
- graph model
- graph theory
- shortest path
- digital circuits
- graph structures
- circuit design
- stable set
- neural network
- analog vlsi
- bipartite graph
- edge detector
- directed edges
- multiscale