128
click to vote
ICALP
2000
Springer
15 years 7 months ago
2000
Springer
We give an O(n log n) algorithm for computing the girth (shortest cycle) of an undirected n-vertex planar graph. Our solution extends to any graph of bounded genus. This improves u...
ICALP
2000
Springer
15 years 7 months ago
2000
Springer
137
click to vote
ICALP
2000
Springer
15 years 7 months ago
2000
Springer
Graph processes are used in order to formalize the relation between global requirement specifications of multi-agent systems by means of message sequence charts, and implementatio...
101
click to vote
ICALP
2000
Springer
15 years 7 months ago
2000
Springer
This paper demonstrates how three stochastic process algebras can be mapped on to a generally-distributed stochastic transition system. We demonstrate an aggregation technique on ...
ICALP
2000
Springer
15 years 7 months ago
2000
Springer
d Abstract) Christian Cachin1 , Jan Camenisch1 , Joe Kilian2 , and Joy M