A new bound for parsimonious edge-colouring of graphs with maximum degree three
Jean-Luc FouquetJean-Marie VanherpePublished in: CoRR (2011)
Keyphrases
- weighted graph
- undirected graph
- random graphs
- upper bound
- graph theoretic
- lower bound
- edge detection
- minimum spanning trees
- worst case
- edge information
- directed graph
- graph partitioning
- multiple scales
- spanning tree
- graph model
- graph mining
- data sets
- graph theory
- multiscale
- graph clustering
- estimation error
- edge weights
- graph structure
- shortest path
- bayesian networks