Algorithms for finding distance-edge-colorings of graphs.

Takehiro Ito Akira Kato Xiao Zhou Takao Nishizeki

Published in: J. Discrete Algorithms (2007)

Keyphrases

data structure
graph theory
theoretical analysis
computationally efficient
combinatorial optimization
learning algorithm
significant improvement
worst case
optimization problems
edge weights
graph data
maximum clique