A note on upper bounds for the maximum span in interval edge-colorings of graphs.
Rafael R. KamalianPetros A. PetrosyanPublished in: Discret. Math. (2012)
Keyphrases
- upper bound
- weighted graph
- lower bound
- undirected graph
- upper and lower bounds
- minimum distance
- minimum spanning trees
- graph matching
- branch and bound algorithm
- branch and bound
- lower and upper bounds
- graph representation
- worst case
- directed graph
- edge information
- edge detector
- tight bounds
- evolutionary algorithm
- sample complexity
- spanning tree
- graph structure
- graph theory
- sample size
- edge detection
- edge map
- maximum number
- graph model
- graph theoretic
- concept classes
- efficiently computable
- upper bounding