139
click to vote
ESAW
2000
Springer
15 years 7 months ago
2000
Springer
We present a first approach that combines the mobile agent and the compositional paradigms into a new agent-based compositional model. The aim of this work is to explore the capabi...
112
Voted
ESA
2000
Springer
15 years 7 months ago
2000
Springer
Abstract. The depth of a planar embedding is a measure of the topological nesting of the biconnected components of the graph. Minimizing the depth of planar embeddings has importan...
134
Voted
ESA
2000
Springer
15 years 7 months ago
2000
Springer
Given a 2-node connected, undirected graph G = (V, E), with n nodes and m edges with real weights, and given a minimum spanning tree (MST) T = (V, ET ) of G, we study the problem o...
146
Voted
ESA
2000
Springer
15 years 7 months ago
2000
Springer
The resource constrained shortest path problem (CSP) asks for the computation of a least cost path obeying a set of resource constraints. The problem is NP-complete. We give theore...
92
Voted
FGR
1998
IEEE
15 years 7 months ago
1998
IEEE
