An Algorithm for Coloring the Vertices of an Arbitrary Finite Graph.
Karl DürrePublished in: GI Jahrestagung (1972)
Keyphrases
- graph structure
- graph based algorithm
- computational complexity
- k means
- hamiltonian cycle
- cost function
- worst case
- objective function
- detection algorithm
- graph construction
- undirected graph
- dominating set
- dynamic programming
- minimum spanning tree
- graph model
- planar graphs
- multiagent evolutionary algorithm
- shortest path problem
- graph representation
- weighted graph
- graph theory
- graph matching
- segmentation algorithm
- random walk
- simulated annealing
- np hard
- preprocessing