Conference Proceedings

The computation of the jump number of convex graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1994) 831 LNCS 176-185
DOI: 10.1007/bfb0019434
7Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

Dahlhaus, E. (1994). The computation of the jump number of convex graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 831 LNCS, pp. 176–185). Springer Verlag. https://doi.org/10.1007/bfb0019434

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free