A linear time algorithm for the generalized stable set problem on triangulated bidirected graphs

Daishin Nakamura, Akihisa Tamura

Research output: Contribution to journalArticle

Abstract

The generalized stable set problem is an extension of the maximum weight stable set problem for undirected graphs to bidirected graphs. This paper shows that the problem on triangulated bidirected graphs is solvable in linear time. We also propose an exact branch and bound algorithm for the general problem by applying the linear time algorithm.

Original languageEnglish
Pages (from-to)162-175
Number of pages14
JournalJournal of the Operations Research Society of Japan
Volume43
Issue number1
Publication statusPublished - 2000 Mar
Externally publishedYes

Fingerprint

Graph
Stable set
Branch and bound algorithm

ASJC Scopus subject areas

  • Decision Sciences(all)
  • Management Science and Operations Research

Cite this

A linear time algorithm for the generalized stable set problem on triangulated bidirected graphs. / Nakamura, Daishin; Tamura, Akihisa.

In: Journal of the Operations Research Society of Japan, Vol. 43, No. 1, 03.2000, p. 162-175.

Research output: Contribution to journalArticle

@article{e0d6478f9a424eeba2190a7a93897aa2,
title = "A linear time algorithm for the generalized stable set problem on triangulated bidirected graphs",
abstract = "The generalized stable set problem is an extension of the maximum weight stable set problem for undirected graphs to bidirected graphs. This paper shows that the problem on triangulated bidirected graphs is solvable in linear time. We also propose an exact branch and bound algorithm for the general problem by applying the linear time algorithm.",
author = "Daishin Nakamura and Akihisa Tamura",
year = "2000",
month = "3",
language = "English",
volume = "43",
pages = "162--175",
journal = "Journal of the Operations Research Society of Japan",
issn = "0453-4514",
publisher = "Operations Research Society of Japan",
number = "1",

}

TY - JOUR

T1 - A linear time algorithm for the generalized stable set problem on triangulated bidirected graphs

AU - Nakamura, Daishin

AU - Tamura, Akihisa

PY - 2000/3

Y1 - 2000/3

N2 - The generalized stable set problem is an extension of the maximum weight stable set problem for undirected graphs to bidirected graphs. This paper shows that the problem on triangulated bidirected graphs is solvable in linear time. We also propose an exact branch and bound algorithm for the general problem by applying the linear time algorithm.

AB - The generalized stable set problem is an extension of the maximum weight stable set problem for undirected graphs to bidirected graphs. This paper shows that the problem on triangulated bidirected graphs is solvable in linear time. We also propose an exact branch and bound algorithm for the general problem by applying the linear time algorithm.

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

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

M3 - Article

AN - SCOPUS:0034147478

VL - 43

SP - 162

EP - 175

JO - Journal of the Operations Research Society of Japan

JF - Journal of the Operations Research Society of Japan

SN - 0453-4514

IS - 1

ER -