Biclique edge cover graphs and confluent drawings

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4372 LNCS, Issue , 2007, Pages 405-416

  Hirsch, Michael ^a   Meijer, Henk ^a   Rappaport, David ^a  

^a QUEEN S UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; HEURISTIC METHODS; VISUALIZATION;

CONFLUENT PLANARITY; STRAIGHTFORWARD TRANSFORMATION;

GRAPH THEORY;

EID: 38149071044     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-70904-6_39     Document Type: Conference Paper

References (15)

1. Devine, J.: Confluent graphs. Master's thesis, Queen's University (2005)
2. Hui, P., Schaefer, M., Štefankovič, D.: Train tracks and confluent drawings. In Pach, J., ed.: Proc. 12th Int. Symp. Graph Drawing (GD 2004). Number 3383 in Lecture Notes in Computer Science, Springer-Verlag (2004) 318-328
3. Newbery, F.J.: Edge concentration: a method for clustering directed graphs. In: Proc. 2nd Int. Works, on Soft. configuration management, ACM Press (1989) 76-85
4. Eppstein, D., Goodrich, M.T., Meng, J.Y.: Confluent layered drawings. In Pach, J., ed.: Proc. 12th Int. Symp. Graph Drawing (GD 2004). Number 3383 in Lecture Notes in Computer Science, Springer-Verlag (2004) 184-194
5. Eppstein, D., Goodrich, M.T., Meng, J.Y.: Delta-confluent drawings. In Healy, P., Nikolov, N.S., eds.: Proc. 13th Int. Symp. Graph Drawing (GD 2005). Number 3843 in Lecture Notes in Computer Science, Springer-Verlag (2006) 165-176
6. Dickerson, M.T., Eppstein, D., Goodrich, M.T., Meng, J.Y.: Confluent drawings: visualizing non-planar diagrams in a planar way. In: Proc. 11th Int. Symp. Graph Drawing (GD 2003). Lecture Notes in Computer Science, Springer-Verlag (2003)
7. Tsukiyama, S., Ide, M., Ariyoshi, H., Shirakawa, I.: A new algorithm for generating all the maximal independent sets. In: SIAM Journal on Computing. Volume 6. (1977) 505-517
8. Alexe, G., Alexe, S., Crama, Y., Foldes, S., Hammer, P.L., Simeone, B.: Consensus algorithms for the generation of all maximal bicliques. Discrete Applied Mathematics 145(1) (2004) 11-21
9. Chiba, N., Nishizeki, T.: Arboricity and subgraph listing algorithms. SIAM J. Comput. 14(1) (1985) 210-223
10. Eppstein, D.: Arboricity and bipartite subgraph listing algorithms. Information Processing Letters 51(4) (1994) 207-211
11. Hirsch, M.: Generating confluent drawings: Theory and practice. Master's thesis, Queen's University (2006)
12. Di Battista, G., Garg, A., Liotta, G.: An experimental comparison of three graph drawing algorithms (extended abstract). In: Proc. 11th Annual Symp. Computar tional Geometry (SCG '95), New York, NY, USA, ACM Press (1995) 306-315
13. Gansner, E.R., North, S.C.: An open graph visualization system and its applications to software engineering. Softw. Pract. Exper. 30(11) (2000) 1203-1233
14. Barghouti, N.S., Mocenigo, J., Lee, W.: Grappa: A graph package in java. In Di Battista, G., ed.: Proc. 5th Int. Symp. Graph Drawing (GD '97). Volume 1353 of Lecture Notes in Computer Science., Springer (1997) 336-343
15. Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice Hall, NJ, USA (1998)