718 search results - page 81 / 144 » Coloring quasi-line graphs |
ECRTS
2007
IEEE
15 years 6 months ago
2007
IEEE
Conventionally, the use of virtual memory in real-time systems has been avoided, the main reason being the difficulties it provides to timing analysis. However, there is a trend ...
104
click to vote
SIROCCO
2000
15 years 1 months ago
2000
: We consider a well known distributed coloring game played on a simple connected graph: initially, each vertex is colored black or white; at each round, each vertex simultaneously...
ISAAC
2005
Springer
15 years 5 months ago
2005
Springer
We present an expected polynomial time algorithm to generate a 2-connected unlabeled planar graph uniformly at random. To do this we first derive recurrence formulas to count the ...
CASES
2007
ACM
15 years 3 months ago
2007
ACM
This paper presents a new register assignment heuristic for procedures in SSA Form, whose interference graphs are chordal; the heuristic is called optimistic chordal coloring (OCC...
118
click to vote
DC
2010
14 years 12 months ago
2010
We present a novel distributed algorithm for the maximal independent set (MIS) problem.1 On bounded-independence graphs (BIG) our deterministic algorithm finishes in O(log n) time,...