Sciweavers

2796 search results - page 252 / 560
» The coolest path problem
Sort
View
SIGCOMM
2012
ACM
13 years 9 months ago
LIFEGUARD: practical repair of persistent route failures
The Internet was designed to always find a route if there is a policycompliant path. However, in many cases, connectivity is disrupted despite the existence of an underlying vali...
Ethan Katz-Bassett, Colin Scott, David R. Choffnes...
RTA
1993
Springer
15 years 10 months ago
Topics in Termination
Abstract. We generalize the various path orderings and the conditions under which they work, and describe an implementation of this general ordering. We look at methods for proving...
Nachum Dershowitz, Charles Hoot
DM
2008
86views more  DM 2008»
15 years 6 months ago
"Catalan traffic" and integrals on the Grassmannian of lines
One proves that certain numbers occurring in a problem of paths enumeration, studied by Niederhausen in [7] (see also [10]), are top intersection numbers in the cohomology ring of...
Taíse Santiago Costa Oliveira
COMBINATORICS
2000
73views more  COMBINATORICS 2000»
15 years 6 months ago
Note on Gy. Elekes's Conjectures Concerning Unavoidable Patterns in Proper Colorings
A counterexample is presented to Gy. Elekes's conjecture concerning the existence of long 2-colored paths in properly colored graphs. A modified version of the conjecture is ...
Vera Rosta
CIAC
1997
Springer
154views Algorithms» more  CIAC 1997»
15 years 10 months ago
Isomorphism for Graphs of Bounded Distance Width
In this paper, we study the Graph Isomorphism problem on graphs of bounded treewidth, bounded degree or bounded bandwidth. Graph Isomorphism can be solved in polynomial time for g...
Koichi Yamazaki, Hans L. Bodlaender, Babette de Fl...