1749 search results - page 116 / 350 » Conditional colorings of graphs |
168
click to vote
ISAAC
2005
Springer
16 years 1 days 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 ...
151
click to vote
CASES
2007
ACM
15 years 10 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...
194
click to vote
DC
2010
15 years 6 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,...
160
click to vote
EJC
2007
15 years 6 months ago
2007
We introduce and study online balanced coloring games on the random graph process. The game is played by a player we call Painter. Edges of the complete graph with n vertices are ...
185
click to vote
GD
2006
Springer
15 years 10 months ago
2006
Springer
st-orientations (st-numberings) or bipolar orientations of undirected graphs are central to many graph algorithms and applications. Several algorithms have been proposed in the pas...