Cuts in matchings of 3-edge-connected cubic graphs.
Kolja KnauerPetru ValicovPublished in: CoRR (2017)
Keyphrases
- weighted graph
- maximum cardinality
- undirected graph
- edge detection
- connected components
- minimum spanning trees
- graph matching
- neighborhood graph
- graph theory
- neural network
- connected graphs
- adjacency graph
- labeled graphs
- strongly connected
- graph representation
- edge information
- graph model
- graph mining
- edge detector
- graph partitioning
- graph databases
- graph theoretic
- minimum weight
- graph structure
- shortest path
- data sets