2314 search results - page 118 / 463 » Minimal Partitions of a Graph |
128
Voted
WWW
2007
ACM
16 years 4 months ago
2007
ACM
A minimal perfect function maps a static set of keys on to the range of integers {0,1,2, ... , - 1}. We present a scalable high performance algorithm based on random graphs for ...
128
Voted
STOC
2009
ACM
16 years 4 months ago
2009
ACM
d Abstract] Virginia Vassilevska School of Mathematics Institute for Advanced Study Princeton, NJ 08540 USA virgi@math.ias.edu Ryan Williams School of Mathematics Institute for Adv...
127
Voted
SODA
2010
ACM
16 years 1 months ago
2010
ACM
We consider the following model for fire containment. We are given an undirected graph G = (V, E) with a source vertex s where the fire starts. At each time step, the firefighters...
117
Voted
CORR
2007
Springer
15 years 3 months ago
2007
Springer
An edge-colored directed graph is observable if an agent that moves along its edges is able to determine his position in the graph after a sufficiently long observation of the edge...
115
click to vote
DAM
2008
15 years 3 months ago
2008
We describe a graph coloring problem associated with the determination of mathematical derivatives. The coloring instances are obtained as intersection graphs of row partitioned s...