Drawing clustered graphs on an orthogonal grid.
Eades, Peter, Feng, Qingwen, Nagamochi, Hiroshi (1999)
Journal of Graph Algorithms and Applications
Similarity:
Eades, Peter, Feng, Qingwen, Nagamochi, Hiroshi (1999)
Journal of Graph Algorithms and Applications
Similarity:
Di Giacomo, Emilio, Didimo, Walter, Liotta, Giuseppe, Palladino, Pietro (2010)
Journal of Graph Algorithms and Applications
Similarity:
Bose, Prosenjit, Czyzowicz, Jurek, Morin, Pat, Wood, David R. (2004)
Journal of Graph Algorithms and Applications
Similarity:
Dávid Hudák, Peter Šugerek (2012)
Discussiones Mathematicae Graph Theory
Similarity:
A graph is called 1-planar if it can be drawn in the plane so that each edge is crossed by at most one other edge. We prove that each 1-planar graph of minimum degree δ ≥ 4 contains an edge with degrees of its endvertices of type (4, ≤ 13) or (5, ≤ 9) or (6, ≤ 8) or (7,7). We also show that for δ ≥ 5 these bounds are best possible and that the list of edges is minimal (in the sense that, for each of the considered edge types there are 1-planar graphs whose set of types of edges contains...
Bohdan Zelinka (1987)
Czechoslovak Mathematical Journal
Similarity:
Cariolaro, David, Fu, Hung-Lin (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Six, Janet M., Kakoulis, Konstantinos G., Tollis, Ioannis G. (2000)
Journal of Graph Algorithms and Applications
Similarity:
Felsner, Stefan, Massow, Mareike (2008)
Journal of Graph Algorithms and Applications
Similarity:
Closson, M., Gartshore, S., Johansen, J., Wismath, S.K. (2001)
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...
Dean, Alice M., Evans, William, Gethner, Ellen, Laison, Joshua D., Safari, Mohammad Ali, Trotter, William T. (2007)
Journal of Graph Algorithms and Applications
Similarity: