Skip to main content
Springer Nature Link
Log in

The computation of the jump number of convex graphs

  • Contributed Papers
  • Conference paper
  • First Online:
Orders, Algorithms, and Applications (ORDAL 1994)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 831))

Included in the following conference series:

  • 701 Accesses

Abstract

A first polynomial time algorithm for the computation of the jump number of a convex bipartite graph is presented. The algorithm uses dynamic programming methods.

Part of the work has been done, while the author visited the Department of Mathematics of the Friedrich-Schiller-University of Jena in March 1990. Most of the work has been done while the author was with the Computer Science Department of the University of Bonn

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. Brandstädt, The Jump Number Problem for Biconvex Graphs and Rectangle Covers of Rectangular Regions, Fundamentals of Computation Theory (J. Csirik, J. Demetrovics, F. Gecseg ed.), LNCS 380, 1989, pp. 68–77.

    Google Scholar 

  2. S. Cook, A Taxonomy of Problems with Fast Parallel Algorithms, Information and Control 64 (1985), pp. 2–22.

    Google Scholar 

  3. G. Chaty, M. Chein, Ordered Matchings and Matchings without Alternating Cycles in Bipartite Graphs, Utilitas Mathematica 16 (1979), pp. 183–187.

    Google Scholar 

  4. H. Müller, Alternating Cycle Free Matchings in Chordal Bipartite Graphs, Order 7 (1990), pp. 11–21.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Basser Dept. of Computer Science, University of Sydney, 2006, NSW, Australia

    Elias Dahlhaus

Authors
  1. Elias Dahlhaus
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Vincent Bouchitté Michel Morvan

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dahlhaus, E. (1994). The computation of the jump number of convex graphs. In: Bouchitté, V., Morvan, M. (eds) Orders, Algorithms, and Applications. ORDAL 1994. Lecture Notes in Computer Science, vol 831. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0019434

Download citation

  • DOI: https://doi.org/10.1007/BFb0019434

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58274-8

  • Online ISBN: 978-3-540-48597-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics