Skip to main content
SpringerLink
Log in
SpringerLink
Log in

The jump number problem for biconvex graphs and rectangle covers of rectangular regions

  • Conference paper
  • First Online:
Fundamentals of Computation Theory (FCT 1989)

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

Included in the following conference series:

Abstract

Let P=(V, ≤p) be a finite partially ordered set (poset) with |V|=n and let L=(1l,...,1n) be a linear extension of P. The pair (1i,1i+1), 1≤i≤n-1, is a jump of P in L if

. The jump number problem is the problem of finding the minimum number of jumps in any linear extension of a given poset P. It is known that for posets P1,P2 with the same comparability graph also the jump numbers of P1 and P2 coincide and that for chordal bipartite graphs the jump number decision problem is NP-complete.

We show in this paper that the jump number of biconvex graphs (a subclass of chordal bipartite graphs) can be determined in polynomial time using several reformulations of the problem and a duality relation between rectangle independent point sets and rectangle covers of rectangular regions known from a result of Chaiken/Kleitman/Saks/Shearer and Franzblau/Kleitman. This solves the jump number problem for biconvex graphs by means of computational geometry. Furthermore for bipartite permutation graphs (a subclass of biconvex graphs) the rectangle cover approach yields a greedy solution which is faster than the dynamic programming solution given by Steiner/Stewart. An optimal rectangle cover can be determined in linear time using the geometric description of the region or the defining permutation.

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, D. Kratsch, On the restriction of some NP-complete graph problems to permutation graphs, Report N/84/80, Friedrich-Schiller-Universität Jena, appeared in FCT'85, LNCS 199, 53–62

    Google Scholar 

  2. A. Brandstädt, J. Spinrad, L. Stewart, Bipartite permutation graphs are bipartite tolerance graphs, Congressus Numerantium Vol. 58, 1987, 165–174

    Google Scholar 

  3. S. Chaiken, D.J. Kleitman, M. Saks, J. Shearer, Covering Regions by Rectangles, SIAM J. Alg. Discr. Math. 1981, 394–410

    Google Scholar 

  4. G. Chaty, M. Chein, Ordered matchings and matchings without alternating cycles in bipartite graphs, Utilitas Mathematica 16, 1979, 183–187

    Google Scholar 

  5. M. Chein, M. Habib, The jump number of dags and posets: an introduction, Ann. Discr. Math. 9, 1980, 189–194

    Google Scholar 

  6. S. Even, A. Pnueli, A. Lempel, Permutation graphs and transitive graphs, J. ACM 19, 1972, 400–410

    Article  Google Scholar 

  7. H. Fauck, Ein optimaler sequentieller und ein paralleler Algorithmus zur Konstruktion minimaler Überdeckungen einfacher, rechtwinkliger, monotoner Polygone in der Ebene durch Rechtecke, Diploma thesis 1988, Humboldt-Universität Berlin

    Google Scholar 

  8. D. Franzblau, D.J. Kleitman, An Algorithm for Constructing Regions with Rectangles: Independence and Minimum Generating Sets for Collections of Intervals, 16th STOC 1984, 167–174

    Google Scholar 

  9. M. Habib, Comparability invariants, in Ordres: Description et Roles, ed. M. Pouzet and D. Richard, 371–386, North-Holland 1984

    Google Scholar 

  10. H. Jung, H. Fauck, personal communication

    Google Scholar 

  11. R.H. Möhring, Algorithmic aspects of comparability graphs and interval graphs, in Graphs and Orders, ed. I. Rival, 41–101, D. Reidel Publ. Co. 1985

    Google Scholar 

  12. H. Müller, Alternating-cycle-free matchings in chordal bipartite graphs, 1988, submitted to Order

    Google Scholar 

  13. W.R. Pulleyblank, On minimizing setups in precedence constrained scheduling, to appear in Discr. Appl. Math.

    Google Scholar 

  14. J. Spinrad, A. Brandstädt, L. Stewart, Bipartite permutation graphs, Discr. Appl. Math. 18 (1987), 279–292

    Google Scholar 

  15. G. Steiner, L. Stewart, A linear time algorithm to find the jump number of 2-dimensional bipartite partial orders, Order 3 (1987), 359–367

    Article  Google Scholar 

  16. L. Stewart, Permutation Graph Structure and Algorithms, Ph. D. thesis, University of Toronto, 1985

    Google Scholar 

  17. M. M. Sysło, Minimizing the jump number for partially ordered sets: A graph-theoretic approach, Order 1 (1984) 7–19

    Article  Google Scholar 

  18. M. M. Sysło, A graph-theoretic approach to the jump number problem, in Graphs and orders, ed. I. Rival, 185–215 D. Reidel Publ. co. 1985

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Sektion Mathematik, Friedrich-Schiller-Universität Jena, Universitätshochhaus, DDR-6900, Jena

    Andreas Brandstädt

Authors
  1. Andreas Brandstädt
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

J. Csirik J. Demetrovics F. Gécseg

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Brandstädt, A. (1989). The jump number problem for biconvex graphs and rectangle covers of rectangular regions. In: Csirik, J., Demetrovics, J., Gécseg, F. (eds) Fundamentals of Computation Theory. FCT 1989. Lecture Notes in Computer Science, vol 380. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51498-8_7

Download citation

  • DOI: https://doi.org/10.1007/3-540-51498-8_7

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51498-5

  • Online ISBN: 978-3-540-48180-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation