2370 search results - page 9 / 474 » The Characterization of Data-Accumulating Algorithms |
STOC
1993
ACM
15 years 3 months ago
1993
ACM
FAW
2008
Springer
15 years 1 months ago
2008
Springer
107
click to vote
DAM
2011
14 years 6 months ago
2011
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...
MICS
2010
14 years 6 months ago
2010
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...
STOC
2010
ACM
15 years 4 months ago
2010
ACM