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 |
| Publication status | Published - 2000 Mar 28 |
| Externally published | Yes |
Fingerprint
Keywords
- (0, ± 1)-matrices
- (0, 1)-polytopes
- Bidirected graphs
- Perfectness
ASJC Scopus subject areas
- Computational Theory and Mathematics
Cite this
Perfect (0, ± 1)-matrices and perfect bidirected graphs. / Tamura, Akihisa.
In: Theoretical Computer Science, Vol. 235, No. 2, 28.03.2000, p. 339-356.Research output: Contribution to journal › Article
}
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)-matrices
KW - (0, 1)-polytopes
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
M3 - Article
VL - 235
SP - 339
EP - 356
JO - Theoretical Computer Science
JF - Theoretical Computer Science
SN - 0304-3975
IS - 2
ER -