Path-based supports for hypergraphs

Journal of Discrete Algorithms

Volumn 14, Issue , 2012, Pages 248-261

  Brandes, Ulrik ^a   Cornelsen, Sabine ^a   Pampel, Barbara ^a   Sallaberry, Arnaud ^b  

^a UNIVERSITY OF KONSTANZ   (Germany)

^b UNIVERSITÉ BORDEAUX 1   (France)

Author keywords

Graph algorithm; Graph drawing; Hypergraph; Metro map layout

Indexed keywords

A-MONOTONE; GRAPH ALGORITHMS; GRAPH DRAWING; HYPERGRAPH; METRO MAP LAYOUT; NP-HARD; PATH-BASED; POLYNOMIAL-TIME; SUBGRAPHS; VERTEX SET;

DRAWING (GRAPHICS); POLYNOMIAL APPROXIMATION;

GRAPH THEORY;

EID: 84860838231     PISSN: 15708667     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jda.2011.12.009     Document Type: Conference Paper

References (18)

1. P. Angelini, E. Colasante, G. Di Battista, F. Frati, and M. Patrignani Monotone drawings of graphs U. Brandes, S. Cornelsen, Proceedings of the 18th International Symposium on Graph Drawing (GD 2010) Lecture Notes in Computer Science vol. 6502 2011 Springer 13 24
2. C. Beeri, R. Fagin, D. Maier, and M. Yannakakis On the desirability of acyclic database schemes Journal of the Association for Computing Machinery 30 4 1983 479 513
3. U. Brandes, S. Cornelsen, B. Pampel, and A. Sallaberry Path-based supports for hypergraphs C. Iliopoulos, W. Smyth, Proceedings of the 21st International Workshop on Combinatorial Algorithms (IWOCA 2010) Lecture Notes in Computer Science vol. 6460 2011 Springer 20 33
4. U. Brandes, S. Cornelsen, B. Pampel, and A. Sallaberry Blocks of hypergraphs applied to hypergraphs and outerplanarity C. Iliopoulos, W. Smyth, Proceedings of the 21st International Workshop on Combinatorial Algorithms (IWOCA 2010) Lecture Notes in Computer Science vol. 6460 2011 Springer 201 211
5. K. Buchin, M. van Kreveld, H. Meijer, B. Speckmann, and K. Verbeek On planar supports for hypergraphs D. Eppstein, E.R. Gansner, Proceedings of the 17th International Symposium on Graph Drawing GD 2009 Lecture Notes in Computer Science vol. 5849 2010 Springer 345 356
6. C. Bujtás, and Z. Tuza Color-bounded hypergraphs, II: Interval hypergraphs and hypertrees Discrete Mathematics 309 2009 6391 6401
7. J. Flower, A. Fish, and J. Howse Euler diagram generation Journal on Visual Languages and Computing 19 6 2008 675 694
8. D.S. Johnson, S. Krishnan, J. Chhugani, S. Kumar, and S. Venkatasubramanian Compressing large boolean matrices using reordering techniques M.A. Nascimento, M.T. Özsu, D. Kossmann, R.J. Miller, J.A. Blakeley, K.B. Schiefer, Proceedings of the 13th International Conference on Very Large Data Bases (VLDB04) 2004 Morgan Kaufmann 13 23
9. D.S. Johnson, and H.O. Pollak Hypergraph planarity and the complexity of drawing Venn diagrams Journal of Graph Theory 11 3 1987 309 325
10. M. Kaufmann, M. van Kreveld, and B. Speckmann Subdivision drawings of hypergraphs I.G. Tollis, M. Patrignani, Proceedings of the 16th International Symposium on Graph Drawing (GD 2008) Lecture Notes in Computer Science vol. 5417 2009 Springer 396 407
11. E. Korach, and M. Stern The clustering matroid and the optimal clustering tree Mathematical Programming, Series B 98 2003 385 414
12. D. Král, J. Kratochvíl, and H.-J. Voss Mixed hypercacti Discrete Mathematics 286 2004 99 113
13. M. Nöllenburg An improved algorithm for the metro-line crossing minimization problem D. Eppstein, E.R. Gansner, Proceedings of the 17th International Symposium on Graph Drawing GD 2009 Lecture Notes in Computer Science vol. 5849 2010 Springer 381 392
14. J. Opatrny Total ordering problem SIAM Journal on Computing 8 1 1979 111 114
15. B. Pampel, Constrained graph drawing, Ph.D. thesis, University of Konstanz, 2011, in preparation.
16. P. Simonetto, D. Auber, and D. Archambault Fully automatic visualisation of overlapping sets Computer Graphics Forum 28 3 2009 967 974
17. R.E. Tarjan, and M. Yannakakis Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs SIAM Journal on Computing 13 3 1984 566 579 (Pubitemid 15514404)
18. A. Wolff Drawing subway maps: A survey Informatik-Forschung und Entwicklung 22 1970 23 44