I/O-optimal algorithms for outerplanar graphs.
Maheshwari, Anil, Zeh, Norbert (2004)
Journal of Graph Algorithms and Applications
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Maheshwari, Anil, Zeh, Norbert (2004)
Journal of Graph Algorithms and Applications
Similarity:
Enrique. Benavent, V. Campos, Angel Corberán, Enrique Mota (1990)
Qüestiió
Similarity:
In this paper we consider the Capacitated Arc Routing Problem, in which a fleet of K vehicles, all of them based on a specific vertex (the depot) and with a known capacity Q, must service a subset of the edges of the graph, with minimum total cost and such that the load assigned to each vehicle does not exceed its capacity. A heuristic algorithm for this problem is proposed consisting of: the selection of K centers, the construction of K connected graphs with associated loads...
Eiglsperger, Markus, Siebenhaller, Martin, Kaufmann, Michael (2005)
Journal of Graph Algorithms and Applications
Similarity:
Suderman, Matthew, Whitesides, Sue (2005)
Journal of Graph Algorithms and Applications
Similarity:
He, G., Liu, J., Zhao, C. (2000)
Journal of Graph Algorithms and Applications
Similarity:
Fernau, Henning (2005)
Journal of Graph Algorithms and Applications
Similarity:
Ján Plesník (1988)
Mathematica Slovaca
Similarity:
Zsolt Tuza (1992)
Acta Universitatis Carolinae. Mathematica et Physica
Similarity: