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.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
E. Boros and O. Čepek, O. On perfect 0, ±1 matrices. Discrete Math., 165/166:81–100, 1997.
M. Conforti, G. Cornuéjols, and C. De Francesco. Perfect 0,±1 matrices. Linear Algebra Appl., 253:299–309, 1997.
E. L. Johnson and M. W. Padberg. Degree-two inequalities, clique facets, and biperfect graphs. Ann. Discrete Math., 16:169–187, 1982.
G. J. Minty. On maximal independent sets of vertices in claw-free graphs. J. Combin. Theory Ser. B, 28:284–304, 1980.
E. C. Sewell. Binary integer programs with two variables per inequality. Math. Programming, 75:467–476, 1996.
A. Tamura. The generalized stable set problem for perfect bidirected graphs. J. Oper. Res. Soc. Japan, 40:401–414, 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nakamura, D., Tamura, A. (1998). The Generalized Stable Set Problem for Claw-Free Bidirected Graphs. In: Bixby, R.E., Boyd, E.A., Ríos-Mercado, R.Z. (eds) Integer Programming and Combinatorial Optimization. IPCO 1998. Lecture Notes in Computer Science, vol 1412. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-69346-7_6
Download citation
DOI: https://doi.org/10.1007/3-540-69346-7_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64590-0
Online ISBN: 978-3-540-69346-8
eBook Packages: Springer Book Archive