A note on upper bounds for the maximum span in interval edge colorings of graphs
Rafael R. KamalianPetros A. PetrosyanPublished in: CoRR (2009)
Keyphrases
- upper bound
- weighted graph
- lower bound
- undirected graph
- upper and lower bounds
- lower and upper bounds
- worst case
- minimum distance
- edge detection
- tight bounds
- minimum spanning trees
- graph theory
- graph matching
- branch and bound
- graph model
- edge information
- maximum number
- graph representation
- edge detector
- edge weights
- directed graph
- efficiently computable
- graph databases
- branch and bound algorithm
- random graphs
- shortest path