Constrained minimum vertex cover in bipartite graphs: Complexity and parameterized algorithms

Jianer Chen; Iyad A. Kanj

doi:10.1016/j.jcss.2003.09.003

Constrained minimum vertex cover in bipartite graphs: Complexity and parameterized algorithms

Jianer Chen
, Iyad A. Kanj

Texas A and M University

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

Original language	English
Pages (from-to)	833-847
Number of pages	15
Journal	Journal of Computer and System Sciences
Volume	67
Issue number	4
DOIs	https://doi.org/10.1016/j.jcss.2003.09.003
State	Published - Dec 2003

ASJC Scopus Subject Areas

Theoretical Computer Science
General Computer Science
Computer Networks and Communications
Computational Theory and Mathematics
Applied Mathematics

Keywords

Bipartite graph
Graph matching
Parameterized computation
Vertex cover

Access to Document

10.1016/j.jcss.2003.09.003

Cite this

@article{660dc546cf0c4c6b8a9f064fb120407f,

title = "Constrained minimum vertex cover in bipartite graphs: Complexity and parameterized algorithms",

keywords = "Bipartite graph, Graph matching, Parameterized computation, Vertex cover",

author = "Jianer Chen and Kanj, \{Iyad A.\}",

year = "2003",

month = dec,

doi = "10.1016/j.jcss.2003.09.003",

language = "English",

volume = "67",

pages = "833--847",

journal = "Journal of Computer and System Sciences",

issn = "0022-0000",

number = "4",

}

TY - JOUR

T1 - Constrained minimum vertex cover in bipartite graphs

T2 - Complexity and parameterized algorithms

AU - Chen, Jianer

AU - Kanj, Iyad A.

PY - 2003/12

Y1 - 2003/12

KW - Bipartite graph

KW - Graph matching

KW - Parameterized computation

KW - Vertex cover

UR - https://www.scopus.com/pages/publications/0348252168

UR - https://www.scopus.com/pages/publications/0348252168#tab=citedBy

U2 - 10.1016/j.jcss.2003.09.003

DO - 10.1016/j.jcss.2003.09.003

M3 - Article

AN - SCOPUS:0348252168

SN - 0022-0000

VL - 67

SP - 833

EP - 847

JO - Journal of Computer and System Sciences

JF - Journal of Computer and System Sciences

IS - 4

ER -

Constrained minimum vertex cover in bipartite graphs: Complexity and parameterized algorithms

ASJC Scopus Subject Areas

Keywords

Access to Document

Other files and links

Cite this