9532 search results - page 143 / 1907 » Logic, Graphs, and Algorithms |
115
click to vote
EOR
2010
15 years 4 months ago
2010
Given an undirected graph G = (V, E) with a set V of vertices and a set E of edges, the graph coloring problem consists of partitioning all vertices into k independent sets and th...
122
click to vote
IWOCA
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. Although there exist many polynomial algorithms for NPhard problems running on a bounded clique-width expression of the input graph, there exists only little comparable w...
142
click to vote
JNW
2007
15 years 4 months ago
2007
— This paper presented a fully distributed algorithm to compute a planar subgraph of the underlying wireless connectivity graph. This work considered the idealized unit disk grap...
101
click to vote
OOPSLA
2005
Springer
15 years 10 months ago
2005
Springer
This paper describes the process used to extend the Boost Graph Library (BGL) for parallel operation with distributed memory. The BGL consists of a rich set of generic graph algor...
121
click to vote
GD
2003
Springer
15 years 9 months ago
2003
Springer
In this paper we consider the problem of drawing and displaying a series of related graphs, i.e., graphs that share all, or parts of the same node set. We present three algorithms...