Skip to main content
SpringerLink
Log in

Optimization in Leveled Graphs

  • Reference work entry
Encyclopedia of Optimization

  • 106 Accesses

Article Outline

Keywords

Multiple Sequence Alignment

Leveled Crossing Minimization

Level Planarization

See also

References

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 2,500.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 2,499.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Eades P, Kelly D (1986) Heuristics for reducing crossings in 2-layered networks. Ars Combin 21A:89–98

    MathSciNet  Google Scholar 

  2. Eades P, Whitesides S (1994) Drawing graphs in two layers. Theoret Comput Sci 131:361–374

    MathSciNet  MATH  Google Scholar 

  3. Eades P, Wormald NC (1994) Edge crossings in drawings of bipartite graphs. Algorithmica 10:379–403

    MathSciNet  Google Scholar 

  4. Fukuda K (1996) Personal Communication

    Google Scholar 

  5. Garey MR, Johnson DS (1983) Crossing number is NP-complete. SIAM J Alg Discrete Meth 4:312–316

    MathSciNet  MATH  Google Scholar 

  6. Grötschel M, Jünger M, Reinelt G (1985) Facets of the linear ordering polytope. Math Program 33:43–60

    MATH  Google Scholar 

  7. Harary F, Schwenk A (1972) A new crossing number for bipartite graphs. Utilitas Math 1:203–209

    MathSciNet  MATH  Google Scholar 

  8. Healy P, Kuusik A (1999) The vertex-exchange graph: A new concept for multi-level crossing minimisation. In: Kratochvil J (ed) Graph Drawing (Proc. GD’99). Lecture Notes Computer Sci. Springer, Berlin, pp 205–216

    Google Scholar 

  9. Jacobson G, Vo K-P (1992) Heaviest increasing/common subsequence problems. In: Apostolico A, Crochemore M, Galil Z, Manber U (eds) Combinatorial Pattern Matching, Third Ann. Symp. (CMP, 1992). Lecture Notes Computer Sci. Springer, Berlin, pp 52–66

    Google Scholar 

  10. Jünger M, Lee E, Mutzel P, Odenthal T (1997) A polyhedral approach to the multi-layer crossing number problem. In: DiBattista G (ed) Graph Drawing (Proc. GD’97). Lecture Notes Computer Sci. Springer, Berlin, pp 13–24

    Google Scholar 

  11. Jünger M, Leipert S, Mutzel P (1998) Level planarity testing in linear time. In: Whitesides S (ed) Graph Drawing (Proc. GD’98). Lecture Notes Computer Sci. Springer, Berlin

    Google Scholar 

  12. Jünger M, Mutzel P (1996) 2-layer straightline crossing minimization: Performance of exact and heuristic algorithms. J Graph Algorithms Appl (JGAA) 1(1):1–25, http://www.cs.brown.edu/publications/jgaa/

    Google Scholar 

  13. Jünger M, Thienel S (2000) The ABACUS system for branch and cut ad price algorithms in integer programming and combinatorial optimization. Softw Pract Exper 30:1325–1352

    MATH  Google Scholar 

  14. Kececioglu JD (1991) Exact and approximation algorithms for DNA sequence reconstruction. PhD Thesis, University Arizona

    Google Scholar 

  15. Kececioglu JD (1993) The maximum weight trace problem in multiple sequence alignment. In: Proc. 4-th Symp. Combinatorial Pattern Matching. Lecture Notes Computer Sci, vol 684, pp 106–119

    Google Scholar 

  16. Lengauer T (1990) Combinatorial algorithms for integrated circuit layout. Wiley, New York

    MATH  Google Scholar 

  17. Mutzel P (1997) An alternative method to crossing minimization on hierarchical graphs. In: North S (ed) Graph Drawing (Proc. GD’96). Lecture Notes Computer Sci. Springer, Berlin, pp 318–333

    Google Scholar 

  18. Mutzel P, Weiskircher R (1998) Two-layer planarization in graph drawing. In: Chwa K-Y, Ibara O (eds) Algorithms and Computation; Ninth Internat. Symp. (ISAAC’98). Lecture Notes Computer Sci. Springer, Berlin, pp 69–78

    Google Scholar 

  19. Reinert K, Lenhof HP, Mutzel P, Mehlhorn K, Kececioglu J (1997) A branch-and-cut algorithm for multiple sequence alignment. In: Proc. First Annual Internat. Conf. Computational Molecular Biology (RECOMB’97), pp 241–250

    Google Scholar 

  20. Shahrokhi F, Sýkora O, Székely LA, Vrťo I (1997) On bipartite crossings, largest biplanar subgraphs, and the linear arrangement problem. In: Workshop Algorithms and Data Structures (WADS’97). of In: Lecture Notes Computer Sci, vol 1272. Springer, Berlin, pp 55–68

    Google Scholar 

  21. Spinrad J, Brandstädt A, Stewart L (1987) Bipartite permutation graphs. Discrete Appl Math 19:279–292

    Google Scholar 

  22. Sugiyama K, Tagawa S, Toda M (1981) Methods for visual understanding of hierarchical systems. IEEE Trans Syst, Man Cybern SMC-11(2):109–125

    MathSciNet  Google Scholar 

  23. Vingron M, Lenhof H-P, Mutzel P (1997) Computational molecular biology. In: Maffioli F, Dell'Amico M, Martello S (eds) Annotated Bibliographies in Combinatorial Optimization. Wiley, New York

    Google Scholar 

  24. Waterman MS, Griggs JR (1986) Interval graphs and maps of DNA. Bull Math Biology 48(2):189–195

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute Computergraphik und Algorithmen Techn., University Wien, Wien, Austria

    Petra Mutzel

Authors
  1. Petra Mutzel
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Chemical Engineering, Princeton University, Princeton, NJ, 08544-5263, USA

    Christodoulos A. Floudas

  2. Center for Applied Optimization, Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL, 32611-6595, USA

    Panos M. Pardalos

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag

About this entry

Cite this entry

Mutzel, P. (2008). Optimization in Leveled Graphs . In: Floudas, C., Pardalos, P. (eds) Encyclopedia of Optimization. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-74759-0_483

Download citation

Publish with us

Policies and ethics

Search

Navigation