Minimum Feedback Vertex Sets in Cocomparability Graphs and Convex Bipartite Graphs

Y. Daniel Liang, Maw Shang Chang

Research output: Contribution to journalArticlepeer-review

64 Scopus citations

Abstract

Polynomial-time algorithms for the feedback vertex set problem in cocomparability graphs and convex bipartite graphs are presented.
Original languageAmerican English
JournalActa Informatica
Volume34
DOIs
StatePublished - May 1997

Disciplines

  • Computer Sciences

Keywords

  • Bipartite Graph
  • Cocomparability Graph
  • Minimum Feedback
  • Minimum Feedback Vertex

Fingerprint

Dive into the research topics of 'Minimum Feedback Vertex Sets in Cocomparability Graphs and Convex Bipartite Graphs'. Together they form a unique fingerprint.

Cite this