A multilevel algorithm for force-directed graph-drawing.
Walshaw, Chris (2003)
Journal of Graph Algorithms and Applications
Similarity:
Walshaw, Chris (2003)
Journal of Graph Algorithms and Applications
Similarity:
Harel, David, Koren, Yehuda (2004)
Journal of Graph Algorithms and Applications
Similarity:
François Clautiaux, Aziz Moukrim, Stéphane Nègre, Jacques Carlier (2004)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
The notion of treewidth is of considerable interest in relation to NP-hard problems. Indeed, several studies have shown that the tree-decomposition method can be used to solve many basic optimization problems in polynomial time when treewidth is bounded, even if, for arbitrary graphs, computing the treewidth is NP-hard. Several papers present heuristics with computational experiments. For many graphs the discrepancy between the heuristic results and the best lower bounds is still very...
Harel, David, Koren, Yehuda (2002)
Journal of Graph Algorithms and Applications
Similarity:
B. Helmi, Adel Rahmani, Martin Pelikan (2014)
International Journal of Applied Mathematics and Computer Science
Similarity:
Lyons, Kelly A., Meijer, Henk, Rappaport, David (1998)
Journal of Graph Algorithms and Applications
Similarity:
Eloranta, Timo, Mäkinen, Erkki (2001)
Divulgaciones Matemáticas
Similarity:
Marc Demange, Bernard Kouakou, Eric Soutif (2011)
The Yugoslav Journal of Operations Research
Similarity:
Shapira, Andrew (1997)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Giardini, Giovanni, Kalmár-Nagy, Tamás (2011)
Mathematical Problems in Engineering
Similarity:
Jasmina Fijuljanin (2012)
The Yugoslav Journal of Operations Research
Similarity:
Ján Plesník (1980)
Mathematica Slovaca
Similarity:
Brandes, Ulrik, Cornelsen, Sabine (2003)
Journal of Graph Algorithms and Applications
Similarity: