29908 search results - page 523 / 5982 » On the Complexity of |
157
click to vote
TGC
2007
Springer
16 years 1 months ago
2007
Springer
We study type systems for termination in the π-calculus from the point of view of type inference. We analyse four systems by Deng and Sangiorgi. We show that inference can be done...
186
click to vote
WADS
2007
Springer
16 years 1 months ago
2007
Springer
Connectivity augmentation problems ask for adding a set of at most k edges whose insertion makes a given graph satisfy a specified connectivity property, such as bridge-connectivi...
192
click to vote
WG
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. We present hardness results, approximation heuristics, and exact algorithms for bottleneck labeled optimization problems arising in the context of graph theory. This long...