9532 search results - page 104 / 1907 » Logic, Graphs, and Algorithms |
STOC
2012
ACM
13 years 1 months ago
2012
ACM
102
click to vote
PODS
2008
ACM
15 years 11 months ago
2008
ACM
A survey of effective characterizations of tree logics. If L is a logic, then an effective characterization for L is an algorithm, which inputs a tree automaton and replies if the...
STACS
2010
Springer
15 years 6 months ago
2010
Springer
Reachability and shortest path problems are NL-complete for general graphs. They are known to be in L for graphs of tree-width 2 [14]. However, for graphs of treewidth larger than ...
SODA
1993
ACM
15 years 17 days ago
1993
ACM
The following bounds on the competitive ratios of deterministic and randomized on-line algorithms for traversing width-w layered graphs are obtained.