论文信息 - Using the Metro-Map Metaphor for Drawing Hypergraphs - 字舞流文

Using the Metro-Map Metaphor for Drawing Hypergraphs

Alexander Wolff | Michael Kaufmann | Fabian Frank | Stephen G. Kobourov | Tamara Mchedlidze | Sergey Pupyrev | Torsten Ueckerdt | S. Kobourov | M. Kaufmann | A. Wolff | T. Ueckerdt | S. Pupyrev | T. Mchedlidze | F. Frank

[1] Alexander Wolff,et al. Drawing and Labeling High-Quality Metro Maps by Mixed-Integer Programming , 2011, IEEE Transactions on Visualization and Computer Graphics.

[2] Ulrik Brandes,et al. Path-based supports for hypergraphs , 2010, J. Discrete Algorithms.

[3] Martin Nöllenburg,et al. An Improved Algorithm for the Metro-line Crossing Minimization Problem , 2009, GD.

[4] Robert F. Cohen,et al. Planarity for Clustered Graphs , 1995, ESA.

[5] Michael A. Bekos,et al. On Metro-Line Crossing Minimization , 2010, J. Graph Algorithms Appl..

[6] Martin Fink,et al. Journal of Graph Algorithms and Applications Ordering Metro Lines by Block Crossings 112 Fink Et Al. Ordering Metro Lines by Block Crossings , 2022 .