Techniques for the refinement of orthogonal graph drawings.
Six, Janet M., Kakoulis, Konstantinos G., Tollis, Ioannis G. (2000)
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:
Lyons, Kelly A., Meijer, Henk, Rappaport, David (1998)
Journal of Graph Algorithms and Applications
Similarity:
Bai, Leqiang, Maeda, Hajime, Ebara, Hiroyuki, Nakano, Hideo (1998)
Journal of Graph Algorithms and Applications
Similarity:
Chimani, Markus, Gutwenger, Carsten, Mutzel, Petra, Wong, Hoi-Ming (2011)
Journal of Graph Algorithms and Applications
Similarity:
Gu, Weiwen (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Harel, David, Koren, Yehuda (2004)
Journal of Graph Algorithms and Applications
Similarity:
Barequet, Gill, Goodrich, Michael T., Riley, Chris (2004)
Journal of Graph Algorithms and Applications
Similarity:
Eloranta, Timo, Mäkinen, Erkki (2001)
Divulgaciones Matemáticas
Similarity:
Barth, Wilhelm, Mutzel, Petra, Jünger, Michael (2004)
Journal of Graph Algorithms and Applications
Similarity:
Ichiro Hofuku, Kunio Oshima (2013)
International Journal of Applied Mathematics and Computer Science
Similarity:
In web search engines, such as Google, the ranking of a particular keyword is determined by mathematical tools, e.g., Pagerank or Hits. However, as the size of the network increases, it becomes increasingly difficult to use keyword ranking to quickly find the information required by an individual user. One reason for this phenomenon is the interference of superfluous information with the link structure. The World Wide Web can be expressed as an enormous directed graph. The purpose of...
Friedrich, Carsten, Eades, Peter (2002)
Journal of Graph Algorithms and Applications
Similarity:
Bachl, S., Brandenburg, F.-J., Gmach, D. (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...