Finding the k Most Vital Elements of an s-t Planar Directed Network
Dimiter Ivanchev (2000)
The Yugoslav Journal of Operations Research
Similarity:
Displaying similar documents to “Upward planarization layout.”
Finding the k Most Vital Elements of an s-t Planar Directed Network
Orthogonal hypergraph drawing for improved visibility.
Eschbach, Thomas, Guenther, Wolfgang, Becker, Bernd (2006)
Journal of Graph Algorithms and Applications
Similarity:
TimGA: A genetic algorithm for drawing undirected graphs.
Eloranta, Timo, Mäkinen, Erkki (2001)
Divulgaciones Matemáticas
Similarity:
The order of node removals in influence diagram
Le Minh Trung (1989)
Kybernetika
Similarity:
A framework for the static and interactive visualization of statecharts.
Castelló, Rodolfo (2002)
Journal of Graph Algorithms and Applications
Similarity:
Sensitivity Analysis of Network Optimization Problems
Dimiter Ivanchev (1995)
The Yugoslav Journal of Operations Research
Similarity:
A broadcasting algorithm with time and message optimum on arrangement graphs.
Bai, Leqiang, Maeda, Hajime, Ebara, Hiroyuki, Nakano, Hideo (1998)
Journal of Graph Algorithms and Applications
Similarity:
On the minimum dummy-arc problem
David J. Michael, Jerzy Kamburowski (1993)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Algorithms for cluster busting in anchored graph drawing.
Lyons, Kelly A., Meijer, Henk, Rappaport, David (1998)
Journal of Graph Algorithms and Applications
Similarity:
Upward planar drawings and switch-regularity heuristics.
Didimo, Walter (2006)
Journal of Graph Algorithms and Applications
Similarity:
Fixed-location circular arc drawing of planar graphs.
Efrat, Alon, Erten, Cesim, Kobourov, Stephen (2007)
Journal of Graph Algorithms and Applications
Similarity: