On strong edge-colouring of subcubic graphs.
Hervé HocquardMickaël MontassierAndré RaspaudPetru ValicovPublished in: Discret. Appl. Math. (2013)
Keyphrases
- weighted graph
- undirected graph
- minimum spanning trees
- edge weights
- edge detection
- edge information
- graph matching
- graph theory
- shortest path
- series parallel
- graph clustering
- graph theoretic
- high level
- spanning tree
- graph model
- edge detector
- graph partitioning
- graph structure
- bipartite graph
- data objects
- genetic algorithm
- directed graph
- scale space
- strongly connected
- disjoint paths
- neural network