### Drawing clustered graphs on an orthogonal grid.

Eades, Peter, Feng, Qingwen, Nagamochi, Hiroshi (1999)

Journal of Graph Algorithms and Applications

Similarity:

Skip to main content (access key 's'),
Skip to navigation (access key 'n'),
Accessibility information (access key '0')

Eades, Peter, Feng, Qingwen, Nagamochi, Hiroshi (1999)

Journal of Graph Algorithms and Applications

Similarity:

Barequet, Gill, Goodrich, Michael T., Riley, Chris (2004)

Journal of Graph Algorithms and Applications

Similarity:

Di Giacomo, Emilio, Didimo, Walter, Liotta, Giuseppe, Palladino, Pietro (2010)

Journal of Graph Algorithms and Applications

Similarity:

Bodlaender, Hans L., Tel, Gerard (2004)

Journal of Graph Algorithms and Applications

Similarity:

Brandes, Ulrik, Cornelsen, Sabine, Wagner, Dorothea (2005)

Journal of Graph Algorithms and Applications

Similarity:

Gutwenger, Carsten, Klein, Karsten, Mutzel, Petra (2008)

Journal of Graph Algorithms and Applications

Similarity:

de Fraysseix, Hubert, Ossona de Mendez, Patrice (2001)

Journal of Graph Algorithms and Applications

Similarity:

Dickerson, Matthew, Eppstein, David, Goodrich, Michael T., Meng, Jeremy Y. (2005)

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:

Eiglsperger, Markus, Siebenhaller, Martin, Kaufmann, Michael (2005)

Journal of Graph Algorithms and Applications

Similarity:

Felsner, Stefan, Liotta, Giuseppe, Wismath, Stephen (2003)

Journal of Graph Algorithms and Applications

Similarity:

Duncan, Christian A., Goodrich, Michael T., Kobourov, Stephen G. (2011)

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...