Morphing planar graph drawings with bent edges.
Lubiw, Anna, Petrick, Mark (2011)
Journal of Graph Algorithms and Applications
Similarity:
Lubiw, Anna, Petrick, Mark (2011)
Journal of Graph Algorithms and Applications
Similarity:
Six, Janet M., Kakoulis, Konstantinos G., Tollis, Ioannis G. (2000)
Journal of Graph Algorithms and Applications
Similarity:
Castelló, Rodolfo (2002)
Journal of Graph Algorithms and Applications
Similarity:
Eschbach, Thomas, Guenther, Wolfgang, Becker, Bernd (2006)
Journal of Graph Algorithms and Applications
Similarity:
Barequet, Gill, Goodrich, Michael T., Riley, Chris (2004)
Journal of Graph Algorithms and Applications
Similarity:
Eades, Peter, Feng, Qingwen, Nagamochi, Hiroshi (1999)
Journal of Graph Algorithms and Applications
Similarity:
Brandes, Ulrik, Cornelsen, Sabine, Wagner, Dorothea (2005)
Journal of Graph Algorithms and Applications
Similarity:
Lyons, Kelly A., Meijer, Henk, Rappaport, David (1998)
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...
Gutwenger, Carsten, Klein, Karsten, Mutzel, Petra (2008)
Journal of Graph Algorithms and Applications
Similarity:
Barth, Wilhelm, Mutzel, Petra, Jünger, Michael (2004)
Journal of Graph Algorithms and Applications
Similarity:
Didimo, Walter, Pizzonia, Maurizio (2003)
Journal of Graph Algorithms and Applications
Similarity:
Carmignani, Andrea, Di Battista, Giuseppe, Didimo, Walter, Matera, Francesco, Pizzonia, Maurizio (2002)
Journal of Graph Algorithms and Applications
Similarity: