4171 search results - page 644 / 835 » Choice numbers of graphs |
159
click to vote
SODA
2010
ACM
16 years 3 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...
183
click to vote
LATIN
2010
Springer
16 years 1 months ago
2010
Springer
Many divide-and-conquer algorithms employ the fact that the vertex set of a graph of bounded treewidth can be separated in two roughly balanced subsets by removing a small subset o...
168
click to vote
ALGOSENSORS
2009
Springer
16 years 1 months ago
2009
Springer
Sensor networks, with their ad hoc deployments, node mobility, and wireless communication, pose serious challenges for developing provably correct and efficient applications. A po...
180
click to vote
INFOCOM
2008
IEEE
16 years 29 days ago
2008
IEEE
—Recently proposed beaconless georouting algorithms are fully reactive, with nodes forwarding packets without prior knowledge of their neighbors. However, existing approaches for...
141
click to vote
GD
2007
Springer
16 years 21 days ago
2007
Springer
Let G = (V, E) be a graph with n vertices and m ≥ 4n edges drawn in the plane. The celebrated Crossing Lemma states that G has at least Ω(m3 /n2 ) pairs of crossing edges; or ...