Sciweavers

2370 search results - page 9 / 474
» The Characterization of Data-Accumulating Algorithms
Sort
View
STOC
1993
ACM
120views Algorithms» more  STOC 1993»
14 years 1 months ago
Characterizing non-deterministic circuit size
Mauricio Karchmer, Avi Wigderson
FAW
2008
Springer
117views Algorithms» more  FAW 2008»
13 years 11 months ago
Characterizing and Computing Minimal Cograph Completions
Daniel Lokshtanov, Federico Mancini, Charis Papado...
DAM
2011
13 years 4 months ago
A General Label Search to investigate classical graph search algorithms
Many graph search algorithms use a labeling of the vertices to compute an ordering of the vertices. We generalize this idea by devising a general vertex labeling algorithmic proce...
Richard Krueger, Geneviève Simonet, Anne Be...
MICS
2010
124views more  MICS 2010»
13 years 4 months ago
An Optimal Algorithm for the k-Fixed-Endpoint Path Cover on Proper Interval Graphs
In this paper we consider the k-fixed-endpoint path cover problem on proper interval graphs, which is a generalization of the path cover problem. Given a graph G and a set T of k v...
George B. Mertzios, Walter Unger
STOC
2010
ACM
161views Algorithms» more  STOC 2010»
14 years 2 months ago
A Full Characterization of Quantum Advice
Scott Aaronson and Andrew Drucker