Skip to main content
SpringerLink
Log in

Minimum feedback vertex sets in cocomparability graphs and convex bipartite graphs

  • Published:
Acta Informatica Aims and scope Submit manuscript

Abstract.

Polynomial-time algorithms for the feedback vertex set problem in cocomparability graphs and convex bipartite graphs are presented.

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

Author information

Authors and Affiliations

  1. Department of Computer Science, Indiana Purdue University at Fort Wayne, Fort Wayne, IN 46805, USA (e-mail: liangy@cvax.ipfw.indiana.edu), , , , , , US

    Y. Daniel Liang

  2. Department of Computer Science and Information Engineering, National Chung Cheng University, Min-Hsiung, Chiayi 621, Taiwan, Republic of China (e-mail: mschang@cs.ccu.edu.tw), , , , , , TW

    Maw-Shang Chang

Authors
  1. Y. Daniel Liang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Maw-Shang Chang
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Received September 14, 1994 / January 18, 1996

Rights and permissions

Reprints and permissions

About this article

Cite this article

Daniel Liang, Y., Chang, MS. Minimum feedback vertex sets in cocomparability graphs and convex bipartite graphs . Acta Informatica 34, 337–346 (1997). https://doi.org/10.1007/s002360050088

Download citation

  • Issue Date:

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

Keywords

Search

Navigation