An efficient implementation of Sugiyama's algorithm for layered graph drawing.
Eiglsperger, Markus, Siebenhaller, Martin, Kaufmann, Michael (2005)
Journal of Graph Algorithms and Applications
Similarity:
Eiglsperger, Markus, Siebenhaller, Martin, Kaufmann, Michael (2005)
Journal of Graph Algorithms and Applications
Similarity:
Gajer, Pawel, Kobourov, Stephen G. (2002)
Journal of Graph Algorithms and Applications
Similarity:
Boris Milašinović, Krešimir Fertalj (2012)
Computer Science and Information Systems
Similarity:
Brandes, Ulrik, Cornelsen, Sabine (2003)
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:
Di Giacomo, Emilio, Didimo, Walter, Liotta, Giuseppe, Meijer, Henk (2005)
Journal of Graph Algorithms and Applications
Similarity:
Morgan, Kerri, Farr, Graham (2007)
Journal of Graph Algorithms and Applications
Similarity:
Edith Hemaspaandra, Jörg Rothe, Holger Spakowski (2006)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
For both the edge deletion heuristic and the maximum-degree greedy heuristic, we study the problem of recognizing those graphs for which that heuristic can approximate the size of a minimum vertex cover within a constant factor of , where is a fixed rational number. Our main results are that these problems are complete for the class of problems solvable via parallel access to . To achieve these main results, we also show that the restriction of the vertex cover problem to those graphs...
Niessen, Thomas (2001)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Maheshwari, Anil, Zeh, Norbert (2004)
Journal of Graph Algorithms and Applications
Similarity:
Di Battista, Giuseppe, Patrignani, Maurizio (2000)
Journal of Graph Algorithms and Applications
Similarity:
Milica Stojanović, Milica Vučković (2007)
Kragujevac Journal of Mathematics
Similarity: