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

Research output: Contribution to journalArticle

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 languageEnglish
Pages (from-to)339-356
Number of pages18
JournalTheoretical Computer Science
Volume235
Issue number2
Publication statusPublished - 2000 Mar 28
Externally publishedYes

Fingerprint

(0, 1)-matrices
Perfect Graphs
Stable Set
Polynomials
Graph in graph theory
Polynomial time

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 journalArticle

@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)-matrices, (0, 1)-polytopes, Bidirected graphs, Perfectness",
author = "Akihisa Tamura",
year = "2000",
month = "3",
day = "28",
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)-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

AN - SCOPUS:0347367246

VL - 235

SP - 339

EP - 356

JO - Theoretical Computer Science

JF - Theoretical Computer Science

SN - 0304-3975

IS - 2

ER -