70 search results - page 3 / 14 » Safe separators for treewidth |
LATIN
2010
Springer
14 years 18 days 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...
STOC
1990
ACM
13 years 9 months ago
1990
ACM
ions (Extended Abstract) Noga Alon Paul Seymour Robin Thomas Let G be an n-vertex graph with nonnegative weights whose sum is 1 assigned to its vertices, and with no minor isomorp...
ICDCS
2010
IEEE
13 years 3 months ago
2010
IEEE
Advances in wireless vehicular networks present us with opportunities for developing new distributed traffic control algorithms that avoid phenomena such as abrupt phase-transition...
FMOODS
2006
13 years 7 months ago
2006
Modern applications distributed across networks such as the Internet may need to evolve without compromising application availability. Object systems are well suited for runtime up...
CDC
2009
IEEE
13 years 3 months ago
2009
IEEE
Abstract-- The safety control problem for hybrid automata with imperfect mode information and continuous control is addressed. When the controller does not have access to the mode ...