On planar supports for hypergraphs

Journal of Graph Algorithms and Applications

Volumn 15, Issue 4, 2011, Pages 533-549

  Buchin, Kevin ^a   van Kreveld, Marc ^b   Meijer, Henk ^c   Speckmann, Bettina ^a   Verbeek, Kevin ^a  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^b UTRECHT UNIVERSITY   (Netherlands)

^c Roosevelt Academy   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

POLYNOMIAL APPROXIMATION; TREES (MATHEMATICS);

GRAPH G; HYPER GRAPH; HYPEREDGES; MAXIMAL DEGREE; NP COMPLETE; NP-HARD; PLANAR SUPPORTS; POLYNOMIAL-TIME; SUBGRAPHS; TIME ALGORITHMS;

FORESTRY;

EID: 84866713141     PISSN: 15261719     EISSN: None     Source Type: Journal    
DOI: 10.7155/jgaa.00237     Document Type: Article

References (18)

1. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin. Network Flows: Theory, Algorithms, and Applications. Prentice Hall, 1993.
2. C. Beeri, R. Fagin, D. Maier, and M. Yannakakis. On the desirability of acyclic database schemes. Journal of the ACM, 30:479-513, 1983.
3. C. Berge. Graphs and Hypergraphs. North-Holland, 1973.
4. K. Booth and G. Lueker. Testing for the consecutive ones property, interval graphs, and planarity using pq-tree algorithms. Journal of Computer and System Sciences, 13:335-379, 1976.
5. U. Brandes, S. Cornelsen, B. Pampel, and A. Sallaberry. Blocks of hyper- graphs - applied to hypergraphs and outerplanarity. In Proc. 21st Inter- national Workshop on Combinatorial Algorithms (IWOCA 2010), volume 6460 of LNCS, pages 201-211. Springer, 2011.
6. U. Brandes, S. Cornelsen, B. Pampel, and A. Sallaberry. Path-based sup- ports for hypergraphs. In Proc. 21st International Workshop on Combi-natorial Algorithms (IWOCA 2010), volume 6460 of LNCS, pages 20-33. Springer, 2011.
7. M. Brinkmeier, J. Werner, and S. Recknagel. Communities in graphs and hypergraphs. In 16th ACM Conference on Information and Knowledge Management, pages 869-872, 2007.
8. T. Cormen, C. Leiserson, R. Rivest, and C. Stein. Introduction to Algo- rithms. MIT Press, 2nd edition, 2001.
9. J. Flower and J. Howse. Generating Euler diagrams. In Proc. Diagrams 2002, volume 2317 of LNCS, pages 61-75. Springer, 2002.
10. W. L. Hsu. A simple test for the consecutive ones property. Journal of Algorithms, 43(1):1-16, 2002.
11. D. Johnson and H. Pollak. Hypergraph planarity and the complexity of drawing Venn diagrams. Journal of Graph Theory, 11(3):309-325, 1987.
12. M. Kaufmann, M. van Kreveld, and B. Speckmann. Subdivision drawings of hypergraphs. In Proc. 16th International Symposium on Graph Drawing (GD 08), volume 5417 of LNCS, pages 396-407. Springer, 2009.
13. E. Korach and M. Stern. The clustering matroid and the optimal clustering tree. Mathematical Programming, Series B, 98:385-414, 2003.
14. J. R. Lundgren. Food webs, competition graphs, competition-common en- emy graphs and niche graphs. Applications of Combinatorics and Graph Theory to the Biological and Social Sciences, 17:221-243, 1989.
15. G. Sander. Layout of directed hypergraphs with orthogonal hyperedges. In Proc. 12th International Symposium on Graph Drawing (GD 04), volume 3393 of LNCS, pages 381-386. Springer, 2005.
16. A. Tamura and Y. Tamura. Degree constrained tree embedding into points in the plane. Information Processing Letters, 44:211-214, 1992.
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:566-579, 1984.
18. A. Tucker. Matrix characterizations of circular-arc graphs. Pacific Journal of Mathematics, 39(2):535-545, 1971.