A Fixed-Parameter Approach to 2-Layer Planarization
暂无分享,去创建一个
Giuseppe Liotta | David R. Wood | Naomi Nishimura | Prabhakar Ragde | Michael R. Fellows | Catherine McCartin | Vida Dujmovic | Matthew Suderman | Michael T. Hallett | Sue Whitesides | Frances A. Rosamond | Matthew Kitching | P. Ragde | S. Whitesides | G. Liotta | M. Fellows | V. Dujmovic | N. Nishimura | M. Hallett | M. Suderman | M. Kitching | Catherine McCartin | D. Wood | D. Wood
[1] Panos M. Pardalos,et al. Encyclopedia of Optimization , 2006 .
[2] Mitsuhiko Toda,et al. Methods for Visual Understanding of Hierarchical System Structures , 1981, IEEE Transactions on Systems, Man, and Cybernetics.
[3] Michael Kaufmann,et al. Drawing graphs: methods and models , 2001 .
[4] Michael Kaufmann,et al. Fixed Parameter Algorithms for one-sided crossing minimization Revisited , 2003, Graph Drawing.
[5] Brendan D. McKay,et al. On an edge crossing problem , 1986 .
[6] Akihiro Sugimoto,et al. An Approximation Algorithm for the Two-Layered Graph Drawing Problem , 1999, COCOON.
[7] Peter Eades,et al. Drawing Graphs in Two Layers , 1994, Theor. Comput. Sci..
[8] Matthew Suderman,et al. Experiments with the Fixed-Parameter Approach for Two-Layer Planarization , 2003, J. Graph Algorithms Appl..
[9] Giuseppe Liotta,et al. On the Parameterized Complexity of Layered Graph Drawing , 2001, Algorithmica.
[10] Petra Mutzel,et al. An Alternative Method to Crossing Minimization on Hierarchical Graphs , 1996, GD.
[11] Peter Eades,et al. Edge crossings in drawings of bipartite graphs , 1994, Algorithmica.
[12] Thomas Lengauer,et al. Combinatorial algorithms for integrated circuit layout , 1990, Applicable theory in computer science.
[13] Camil Demetrescu,et al. Break the "Right" Cycles and Get the "Best" Drawing , 2000 .
[14] Imrich Vrto,et al. One Sided Crossing Minimization Is NP-Hard for Sparse Graphs , 2001, GD.
[15] Farhad Shahrokhi,et al. On Bipartite Drawings and the Linear Arrangement Problem , 2001, SIAM J. Comput..
[16] Petra Mutzel,et al. Two-Layer Planarization in Graph Drawing , 1998, ISAAC.
[17] Vida Dujmovic,et al. An Efficient Fixed Parameter Tractable Algorithm for 1-Sided Crossing Minimization , 2002, Graph Drawing.
[18] Jerrold R. Griggs,et al. Interval graphs and maps of DNA. , 1986, Bulletin of mathematical biology.
[19] Michael R. Fellows,et al. Parameterized Complexity , 1998 .
[20] R. Martí,et al. A branch and bound algorithm for minimizing the number of crossing arcs in bipartite graphs , 1996 .
[21] Michael Jünger,et al. Journal of Graph Algorithms and Applications 2-layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms , 2022 .
[22] David S. Johnson,et al. Crossing Number is NP-Complete , 1983 .
[23] Giuseppe Liotta,et al. On the Parameterized Complexity of Layered Graph Drawing , 2001, ESA.
[24] Camil Demetrescu,et al. Breaking cycles for minimizing crossings , 2001, JEAL.
[25] Hiroshi Nagamochi,et al. An Improved Approximation to the One-Sided Bilayer Drawing , 2003, GD.