9532 search results - page 67 / 1907 » Logic, Graphs, and Algorithms |
COCO
2010
Springer
14 years 8 months ago
2010
Springer
An even cycle in a graph is called nice by Lov
GECCO
2006
Springer
15 years 2 months ago
2006
Springer
This paper presents an algorithm for solving a number of generalized graph coloring problems. Specifically, it gives an agent-based algorithm for the Bandwidth Coloring problem. U...
IPL
2007
14 years 11 months ago
2007
The disk dimension of a planar graph G is the least number k for which G embeds in the plane minus k open disks, with every vertex on the boundary of some disk. Useful properties ...
PPSC
1997
15 years 14 days ago
1997
In this paper we present a parallel formulation of a multilevel k-way graph partitioning algorithm, that is particularly suited for message-passing libraries that have high latenc...
ALGORITHMICA
2008
14 years 11 months ago
2008
We show efficient algorithms for edge-coloring planar graphs. Our main result is a linear-time algorithm for coloring planar graphs with maximum degree with max{, 9} colors. Thus...