Kőnig's edge-colouring theorem for all graphs.
Denis CornazV. H. NguyenPublished in: Oper. Res. Lett. (2013)
Keyphrases
- weighted graph
- undirected graph
- graph theoretic
- minimum spanning trees
- edge detection
- series parallel
- graph theory
- graph mining
- graph matching
- structured objects
- adjacency graph
- graph structure
- edge weights
- graph databases
- graph representation
- edge points
- densely connected
- edge direction
- data mining
- random graphs
- graph data
- edge information
- matching algorithm
- random walk
- d objects
- pattern recognition
- learning algorithm