3204 search results - page 568 / 641 » The Alcuin Number of a Graph |
75
Voted
CAV
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. We address the verification problem of programs manipulating oneselector linked data structures. We propose a new automated approach for checking safety and termination f...
110
click to vote
CIAC
2006
Springer
15 years 4 months ago
2006
Springer
Virtual private network design in the hose model deals with the reservation of capacities in a weighted graph such that the terminals in this network can communicate with one anoth...
128
Voted
ESA
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. We consider the problem of finding shortest paths in a graph with independent randomly distributed edge lengths. Our goal is to maximize the probability that the path len...
114
click to vote
FSTTCS
2000
Springer
15 years 4 months ago
2000
Springer
Abstract. We describe some new, simple and apparently general methods for designing FPT algorithms, and illustrate how these can be used to obtain a signi cantly improved FPT algor...
102
Voted
ICALP
2000
Springer
15 years 4 months ago
2000
Springer
We establish that the algorithmic complexity of the minimum spanning tree problem is equal to its decision-tree complexity. Specifically, we present a deterministic algorithm to fi...