The generalized stable set problem for claw-free bidirected graphs

Daishin Nakamura, Akihisa Tamura

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

Abstract

Bidirected graphs are a generalization of undirected graphs. The generalized stable set problem is an extension of the maximum weight stable set problem for undirected graphs to bidirected graphs. It is known that the latter problem is polynomially solvable for claw-free undirected graphs. In this paper, we define claw-free bidirected graphs and show that the generalized stable set problem is also polynomially solvable for claw-free bidirected graphs.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
PublisherSpringer Verlag
Pages69-83
Number of pages15
Volume1412
ISBN (Print)354064590X, 9783540645900
DOIs
Publication statusPublished - 1998
Externally publishedYes
Event6th International Integer Programming and Combinatorial Optimization Conference, IPCO 1998 - Houston, United States
Duration: 1998 Jun 221998 Jun 24

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1412
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other6th International Integer Programming and Combinatorial Optimization Conference, IPCO 1998
CountryUnited States
CityHouston
Period98/6/2298/6/24

Fingerprint

Claw-free Graphs
Stable Set
Undirected Graph
Graph in graph theory

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Nakamura, D., & Tamura, A. (1998). The generalized stable set problem for claw-free bidirected graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1412, pp. 69-83). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1412). Springer Verlag. https://doi.org/10.1007/3-540-69346-7_6

The generalized stable set problem for claw-free bidirected graphs. / Nakamura, Daishin; Tamura, Akihisa.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 1412 Springer Verlag, 1998. p. 69-83 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1412).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Nakamura, D & Tamura, A 1998, The generalized stable set problem for claw-free bidirected graphs. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 1412, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1412, Springer Verlag, pp. 69-83, 6th International Integer Programming and Combinatorial Optimization Conference, IPCO 1998, Houston, United States, 98/6/22. https://doi.org/10.1007/3-540-69346-7_6
Nakamura D, Tamura A. The generalized stable set problem for claw-free bidirected graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 1412. Springer Verlag. 1998. p. 69-83. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/3-540-69346-7_6
Nakamura, Daishin ; Tamura, Akihisa. / The generalized stable set problem for claw-free bidirected graphs. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 1412 Springer Verlag, 1998. pp. 69-83 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{4d89289ec8ea4da0bf91b17e6bbde963,
title = "The generalized stable set problem for claw-free bidirected graphs",
abstract = "Bidirected graphs are a generalization of undirected graphs. The generalized stable set problem is an extension of the maximum weight stable set problem for undirected graphs to bidirected graphs. It is known that the latter problem is polynomially solvable for claw-free undirected graphs. In this paper, we define claw-free bidirected graphs and show that the generalized stable set problem is also polynomially solvable for claw-free bidirected graphs.",
author = "Daishin Nakamura and Akihisa Tamura",
year = "1998",
doi = "10.1007/3-540-69346-7_6",
language = "English",
isbn = "354064590X",
volume = "1412",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "69--83",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - The generalized stable set problem for claw-free bidirected graphs

AU - Nakamura, Daishin

AU - Tamura, Akihisa

PY - 1998

Y1 - 1998

N2 - Bidirected graphs are a generalization of undirected graphs. The generalized stable set problem is an extension of the maximum weight stable set problem for undirected graphs to bidirected graphs. It is known that the latter problem is polynomially solvable for claw-free undirected graphs. In this paper, we define claw-free bidirected graphs and show that the generalized stable set problem is also polynomially solvable for claw-free bidirected graphs.

AB - Bidirected graphs are a generalization of undirected graphs. The generalized stable set problem is an extension of the maximum weight stable set problem for undirected graphs to bidirected graphs. It is known that the latter problem is polynomially solvable for claw-free undirected graphs. In this paper, we define claw-free bidirected graphs and show that the generalized stable set problem is also polynomially solvable for claw-free bidirected graphs.

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

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

U2 - 10.1007/3-540-69346-7_6

DO - 10.1007/3-540-69346-7_6

M3 - Conference contribution

AN - SCOPUS:84958761126

SN - 354064590X

SN - 9783540645900

VL - 1412

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 69

EP - 83

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

PB - Springer Verlag

ER -