2796 search results - page 118 / 560 » The coolest path problem |
136
click to vote
CSL
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. For deterministic tree automata, classical hierarchies, like MostowskiRabin (or index) hierarchy, Borel hierarchy, or Wadge hierarchy, are known to be decidable. However,...
166
Voted
ICALP
2011
Springer
14 years 8 months ago
2011
Springer
We present an O( √ n log n)-approximation algorithm for the problem of finding the sparsest spanner of a given directed graph G on n vertices. A spanner of a graph is a sparse ...
154
Voted
CATS
2008
15 years 6 months ago
2008
In this paper we consider a problem that occurs when drawing public transportation networks. Given an embedded graph G = (V, E) (e.g. the railroad network) and a set H of paths in...
138
click to vote
FOCS
1996
IEEE
15 years 9 months ago
1996
IEEE
In the minimum path coloring problem, we are given a list of pairs of vertices of a graph. We are asked to connect each pair by a colored path. Paths of the same color must be edg...
122
click to vote
ASPDAC
2000
ACM
15 years 8 months ago
2000
ACM
We present a satisfiability based multi-clock path analysis method. The method uses propositional satisfiability (SAT) in the detection of multi-clock paths. We show a method to re...