Local optimization of colorings of graphs
From MaRDI portal
Publication:3780451
DOI10.1007/BF01068683zbMath0639.68060MaRDI QIDQ3780451
Publication date: 1986
Published in: Cybernetics (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Cites Work
- Unnamed Item
- Unnamed Item
- An axiomatic proof technique for parallel programs
- The Complexity of Near-Optimal Graph Coloring
- New methods to color the vertices of a graph
- An upper bound for the chromatic number of a graph and its application to timetabling problems
- A technique for colouring a graph applicable to large scale timetabling problems
- Depth-First Search and Linear Graph Algorithms
- The preparation of examination time-tables using a small-store computer