Skip to main content
SpringerLink
Log in

The Generalized Stable Set Problem for Claw-Free Bidirected Graphs

  • Conference paper
  • First Online:
Integer Programming and Combinatorial Optimization (IPCO 1998)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1412))

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. E. Boros and O. Čepek, O. On perfect 0, ±1 matrices. Discrete Math., 165/166:81–100, 1997.

    Article  Google Scholar 

  2. M. Conforti, G. Cornuéjols, and C. De Francesco. Perfect 0,±1 matrices. Linear Algebra Appl., 253:299–309, 1997.

    Article  MATH  MathSciNet  Google Scholar 

  3. E. L. Johnson and M. W. Padberg. Degree-two inequalities, clique facets, and biperfect graphs. Ann. Discrete Math., 16:169–187, 1982.

    MATH  MathSciNet  Google Scholar 

  4. G. J. Minty. On maximal independent sets of vertices in claw-free graphs. J. Combin. Theory Ser. B, 28:284–304, 1980.

    Article  MATH  MathSciNet  Google Scholar 

  5. E. C. Sewell. Binary integer programs with two variables per inequality. Math. Programming, 75:467–476, 1996.

    MathSciNet  Google Scholar 

  6. A. Tamura. The generalized stable set problem for perfect bidirected graphs. J. Oper. Res. Soc. Japan, 40:401–414, 1997.

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Information Mathematics, University of Electro-Communications, 1-5-1 Chofugaoka, Chofu, Tokyo, 182-8585, Japan

    Daishin Nakamura & Akihisa Tamura

Authors
  1. Daishin Nakamura
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Akihisa Tamura
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computational and Applied Mathematics, Rice University, 6020 Annapolis, Houston, TX, 77005, USA

    Robert E. Bixby

  2. PROS Strategic Solutions, 3223 Smith Street, Houston, TX, 77006, USA

    E. Andrew Boyd

  3. Department of Industrial, Engineering, Texas A&M University, 1000 Country Place Dr. Apt. 69, Houston, TX, 77079, USA

    Roger Z. Ríos-Mercado

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation