Maximum edge colouring problem on graphs that exclude a fixed minor.
Zdenek DvorákAbhiruk LahiriPublished in: CoRR (2023)
Keyphrases
- weighted graph
- undirected graph
- minimum spanning trees
- edge detection
- edge information
- adjacency graph
- graph theory
- graph representation
- fixed number
- graph matching
- series parallel
- graph clustering
- edge map
- graph partitioning
- multiple scales
- edge weights
- labeled graphs
- graph theoretic
- complex structures
- maximum number
- data sets
- graph databases
- graph model
- edge detector
- pairwise
- pattern recognition
- multiscale