Locally irregular edge-coloring of subcubic graphs.
Borut LuzarMária MacekováSimona RindosováRoman SotákKatarína SrokováKenny StorgelPublished in: CoRR (2022)
Keyphrases
- weighted graph
- undirected graph
- minimum spanning trees
- graph theoretic
- edge information
- edge detection
- graph partitioning
- adjacency graph
- random graphs
- edge weights
- multiple scales
- graph theory
- approximation algorithms
- neural network
- irregularly shaped
- graph clustering
- graph structures
- globally consistent
- graph representation
- graph databases
- graph mining
- edge detector
- directed graph
- shortest path
- multiresolution
- pattern recognition
- bayesian networks
- clustering algorithm
- image processing