Minimum Feedback Vertex Sets in Cocomparability Graphs and Convex Bipartite Graphs

Y. Daniel Liang; Maw Shang Chang

doi:10.1007/s002360050088

Minimum Feedback Vertex Sets in Cocomparability Graphs and Convex Bipartite Graphs

Y. Daniel Liang
, Maw Shang Chang

Computer Science

Indiana Purdue Univ at Fort Wayne
National Chung Cheng University

Research output: Contribution to journal › Article › peer-review

66 Scopus citations

Abstract

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

Original language	American English
Journal	Acta Informatica
Volume	34
DOIs	https://doi.org/10.1007/s002360050088
State	Published - May 1997

Disciplines

Computer Sciences

Keywords

Bipartite Graph
Cocomparability Graph
Minimum Feedback
Minimum Feedback Vertex

Access to Document

10.1007/s002360050088License: Unspecified

Cite this

@article{20f54c56f2a04c42ae825fce6b06212f,

title = "Minimum Feedback Vertex Sets in Cocomparability Graphs and Convex Bipartite Graphs",

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

keywords = "Bipartite Graph, Cocomparability Graph, Minimum Feedback, Minimum Feedback Vertex",

author = "Liang, \{Y. Daniel\} and Chang, \{Maw Shang\}",

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

year = "1997",

month = may,

doi = "10.1007/s002360050088",

language = "American English",

volume = "34",

journal = "Acta Informatica",

issn = "0001-5903",

publisher = "Springer New York",

}

TY - JOUR

T1 - Minimum Feedback Vertex Sets in Cocomparability Graphs and Convex Bipartite Graphs

AU - Liang, Y. Daniel

AU - Chang, Maw Shang

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

PY - 1997/5

Y1 - 1997/5

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

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

KW - Bipartite Graph

KW - Cocomparability Graph

KW - Minimum Feedback

KW - Minimum Feedback Vertex

UR - https://link.springer.com/article/10.1007/s002360050088

U2 - 10.1007/s002360050088

DO - 10.1007/s002360050088

M3 - Article

SN - 0001-5903

VL - 34

JO - Acta Informatica

JF - Acta Informatica

ER -

Minimum Feedback Vertex Sets in Cocomparability Graphs and Convex Bipartite Graphs

Abstract

Disciplines

Keywords

Access to Document

Other files and links

Fingerprint

Cite this