Searching for "Ordered 3-colorings." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

2 documents found, showing 1 through 2.

Distributed computing with advice: Information sensitivity of graph coloring
by Pierre Fraigniaud, Cyril Gavoille, David Ilcinkas, Andrzej Pelc, Université Bordeaux — 2007 — In 34th International Colloquium on Automata, Languages and Programming (ICALP
…) bits of advice are needed in order to beat the O(log ∗ n) time of 3-coloring an oriented tree [10…
Cited by 1 (0 self) – Add To MetaCart

Tóth: Decomposition of multiple coverings into many parts
by János Pach, Géza Tóth — 2007 — in: Proc. 23rd ACM Symposium on Computational Geometry, ACM
…,... ,b n+i,t(n+i) contain all singular points, in opposite orders. 3 The coloring algorithm: Proof…
Cited by 2 (2 self) – Add To MetaCart

Showing 1 through 2.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB