3268 search results - page 490 / 654 » The hub number of a graph |
194
click to vote
SIGMOD
2004
ACM
16 years 6 months ago
2004
ACM
Increasing popularity of XML in recent years has generated much interest in query processing over graph-structured data. To support efficient evaluation of path expressions, many ...
158
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...
177
click to vote
EUROSYS
2006
ACM
16 years 3 months ago
2006
ACM
—Restoring data operations after a disaster is a daunting task: how should recovery be performed to minimize data loss and application downtime? Administrators are under consider...
180
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...
166
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...