2310 search results - page 160 / 462 » Coloring Random Graphs |
112
click to vote
COMBINATORICS
2004
15 years 2 months ago
2004
Let G be the intersection graph of a finite family of convex sets obtained by translations of a fixed convex set in the plane. We show that every such graph with clique number k i...
119
click to vote
APPROX
2004
Springer
15 years 8 months ago
2004
Springer
Consider the following communication problem, that leads to a new notion of edge coloring. The communication network is represented by a bipartite multigraph, where the nodes on o...
100
click to vote
ICCAD
1996
IEEE
15 years 6 months ago
1996
IEEE
This paper presents a new approach for diagnosing stuck-at and short faults in interconnects whose layouts are known. This structural approach exploits dierent graph coloring and ...
130
click to vote
CPC
2004
15 years 2 months ago
2004
The strong chromatic number, S(G), of an n-vertex graph G is the smallest number k such that after adding kn/k-n isolated vertices to G and considering any partition of the vertic...
105
click to vote
ICALP
2001
Springer
15 years 7 months ago
2001
Springer
Given an undirected graph with positive edge weights, define Nq(v) for each node v to be the set of q nodes closest to v (including v itself and breaking ties by node ID). It is ...