Skip to main content
SpringerLink
Log in

On the Jump Number Problem in Hereditary Classes of Bipartite Graphs

  • Published:
Order Aims and scope Submit manuscript

Abstract

We prove a necessary condition for polynomial solvability of the jump number problem in classes of bipartite graphs characterized by a finite set of forbidden induced bipartite subgraphs. For some classes satisfying this condition, we propose polynomial algorithms to solve the jump number problem.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Alekseev, V. E. (1999) A polynomial algorithm for the stable set problem in chair-free graphs, Discrete Anal. Oper. Res., to appear (in Russian).

  2. Brandstädt, A., Spinrad, J. and Stewart, L. (1987) Bipartite permutation graphs, Discrete Appl. Math. 18, 279-292.

    Google Scholar 

  3. Brandstädt, A. (1989) The jump number problem for biconvex graphs and rectangle covers of rectangular regions, in Fundamentals of Computing Theory, Lecture Notes in Comput. Sci. 380, pp. 68-77.

  4. Chaty, G. and Chein, M. (1979) Ordered matching and matchings without alternating cycles in bipartite graphs, Utilitas Math. 16, 183-187.

    Google Scholar 

  5. Chein, M. and Martin, P. (1972) Sur le nombre de saunts d'une forêt, C.R. Acad. Sci. Paris Ser. A 275, 159-161.

    Google Scholar 

  6. Dahlhaus, E. (1994) The computation of the jump number of convex graphs, in Proc. ORDAL'94, Lecture Notes in Comput. Sci. 831, pp. 176-185.

  7. Müller, H. (1990) Alternating cycle free matchings in chordal bipartite graphs, Order 7, 11-21.

    Google Scholar 

  8. Pulleyblank, W. (1982) On minimizing setups in precedence constrained scheduling, Unpublished manuscript.

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

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Nizhny Novgorod University, Gagarina 23, Nizhny Novgorod, 603600, Russia

    Vadim V. Lozin

  2. Department of Mathematics, Swiss Federal Institute of Technology, CH-1015, Lausanne, Switzerland

    Michael U. Gerber

Authors
  1. Vadim V. Lozin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Michael U. Gerber
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lozin, V.V., Gerber, M.U. On the Jump Number Problem in Hereditary Classes of Bipartite Graphs. Order 17, 377–385 (2000). https://doi.org/10.1023/A:1006437630359

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1006437630359

Search

Navigation