Perfect (0, ± 1)-matrices and perfect bidirected graphs

Akihisa Tamura

doi:10.1016/S0304-3975(99)00203-0

Perfect (0, ± 1)-matrices and perfect bidirected graphs

Akihisa Tamura

Research output: Contribution to journal › Article

1 Citation (Scopus)

Abstract

Perfect (0, ± 1)-matrices and perfect bidirected graphs are independently defined but are closely related. In this paper, we discuss these relations and give several characterizations of perfectness. The generalized stable set problem associated with bidirected graphs is a generalization of the maximum weighted stable set problem. We also give a brief proof that if a given bidirected graph is perfect, then the problem can be solved in polynomial time.

Original language	English
Pages (from-to)	339-356
Number of pages	18
Journal	Theoretical Computer Science
Volume	235
Issue number	2
DOIs	https://doi.org/10.1016/S0304-3975(99)00203-0
Publication status	Published - 2000 Mar 28
Externally published	Yes

Keywords

(0, 1)-polytopes
(0, ± 1)-matrices
Bidirected graphs
Perfectness

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1016/S0304-3975(99)00203-0

Fingerprint Dive into the research topics of 'Perfect (0, ± 1)-matrices and perfect bidirected graphs'. Together they form a unique fingerprint.

Cite this

Tamura, A. (2000). Perfect (0, ± 1)-matrices and perfect bidirected graphs. Theoretical Computer Science, 235(2), 339-356. https://doi.org/10.1016/S0304-3975(99)00203-0

@article{faeed24bf1a6462487324d7365bf5bc1,

title = "Perfect (0, ± 1)-matrices and perfect bidirected graphs",

abstract = "Perfect (0, ± 1)-matrices and perfect bidirected graphs are independently defined but are closely related. In this paper, we discuss these relations and give several characterizations of perfectness. The generalized stable set problem associated with bidirected graphs is a generalization of the maximum weighted stable set problem. We also give a brief proof that if a given bidirected graph is perfect, then the problem can be solved in polynomial time.",

keywords = "(0, 1)-polytopes, (0, ± 1)-matrices, Bidirected graphs, Perfectness",

author = "Akihisa Tamura",

year = "2000",

month = mar,

day = "28",

doi = "10.1016/S0304-3975(99)00203-0",

language = "English",

volume = "235",

pages = "339--356",

journal = "Theoretical Computer Science",

issn = "0304-3975",

publisher = "Elsevier",

number = "2",

}

TY - JOUR

T1 - Perfect (0, ± 1)-matrices and perfect bidirected graphs

AU - Tamura, Akihisa

PY - 2000/3/28

Y1 - 2000/3/28

N2 - Perfect (0, ± 1)-matrices and perfect bidirected graphs are independently defined but are closely related. In this paper, we discuss these relations and give several characterizations of perfectness. The generalized stable set problem associated with bidirected graphs is a generalization of the maximum weighted stable set problem. We also give a brief proof that if a given bidirected graph is perfect, then the problem can be solved in polynomial time.

AB - Perfect (0, ± 1)-matrices and perfect bidirected graphs are independently defined but are closely related. In this paper, we discuss these relations and give several characterizations of perfectness. The generalized stable set problem associated with bidirected graphs is a generalization of the maximum weighted stable set problem. We also give a brief proof that if a given bidirected graph is perfect, then the problem can be solved in polynomial time.

KW - (0, 1)-polytopes

KW - (0, ± 1)-matrices

KW - Bidirected graphs

KW - Perfectness

UR - http://www.scopus.com/inward/record.url?scp=0347367246&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0347367246&partnerID=8YFLogxK

U2 - 10.1016/S0304-3975(99)00203-0

DO - 10.1016/S0304-3975(99)00203-0

M3 - Article

AN - SCOPUS:0347367246

VL - 235

SP - 339

EP - 356

JO - Theoretical Computer Science

JF - Theoretical Computer Science

SN - 0304-3975

IS - 2

ER -