Back to Results
First PageMeta Content
Theoretical computer science / Interval tree / Delaunay triangulation / Edge coloring / Greedy coloring / Graph theory / Graph coloring / Mathematics


CCCG 2008, Montr´eal, Qu´ebec, August 13–15, 2008 Fault-Tolerant Conflict-Free Colorings Mohammad Ali Abam∗ 1
Add to Reading List

Document Date: 2008-10-29 00:05:21

Open Document

File Size: 156,45 KB

Share Result on Facebook

City

Hsin-Chu / /

Company

Fiat / Cambridge University Press / /

Country

Taiwan / Netherlands / /

/

Facility

Arhus University / National Tsing Hua University / /

IndustryTerm

Online Computation / on-line setting / cellular network / cellular networks / above algorithm / deterministic coloring algorithms / /

Organization

Arhus University / Danish National Research Foundation / Cambridge University / Organisation for Scientific Research / MADALGO Center / National Tsing Hua University / Department of Computer Science / /

Person

Hung Poon / Bettina Speckmann / /

Technology

above algorithm / 2008 algorithm / Parallelism Algorithms / deterministic coloring algorithms / /

SocialTag