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 | |
| 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)