Skip to main content
SpringerLink
Log in
Book cover

Advanced Intelligent Computational Technologies and Decision Support Systems pp 211–217Cite as

A Recognition Algorithm and Some Optimization Problems on Weakly Quasi-Threshold Graphs

  • Chapter
  • First Online:

  • 929 Accesses

Part of the book series: Studies in Computational Intelligence ((SCI,volume 486))

Abstract

Graph theory provides algorithms and tools to handle models for important applications in medicine, such as drug design, diagnosis, validation of graph-theoretical methods for pattern identification in public health datasets. In this chapter we characterize weakly quasi-threshold graphs using the weakly decomposition, determine: density and stability number for weakly quasi-threshold graphs.

This is a preview of subscription content, 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   84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   109.99
Price excludes VAT (USA)
  • Durable hardcover 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

Learn about institutional subscriptions

References

  1. Corneil, D.G., Lerchs, H., Stewart, L.K.: Complement reducible graphs. Discrete Appl. Math. 3, 163–174 (1981)

    Article  MathSciNet  MATH  Google Scholar 

  2. Bapat, R.B., Lal, A.K., Pati, S.: Laplacian spectrum of weakly quasi-threshold graphs. Graphs and Combinatorics 24, 273–290 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  3. Corneil, D.G., Perl, Y., Stewart, L.K.: A linear recognition algorithm for cographs. SIAM J. Comput. 14, 926–934 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  4. Brandstadt, A., Le, V.B., Spinrad, J.P.: Graph classes: a survey, SIAM Monographs on, Discrete Mathematics and Applications (1999).

    Google Scholar 

  5. Golumbic, M.C.: Algorithmic graph theory and perfect graphs. Second edition. Annals of Discrete Mathematics, vol. 57, Elsevier, Amsterdam (2004).

    Google Scholar 

  6. Berge, C.: Graphs. Nort-Holland, Amsterdam (1985)

    MATH  Google Scholar 

  7. Croitoru, C., Talmaciu, M.: A new graph search algorithm and some applications, presented at ROSYCS 2000, Alexandru Ioan Cuza University of Iaşi (2000).

    Google Scholar 

  8. Talmaciu, M.: Decomposition problems in the graph theory with applications in combinatorial optimization. PhD. Thesis, Alexandru Ioan Cuza University of Iasi, Romania (2002).

    Google Scholar 

  9. Talmaciu, M., Nechita, E.: Recognition algorithm for diamond-free graphs. Informatica 18(3), 457–462 (2007)

    MathSciNet  MATH  Google Scholar 

  10. Croitoru, C., Olaru, E., Talmaciu, M.: Confidentially connected graphs, The annals of the University "Dunarea de Jos" of Galati, Suppliment to Tome XVIII (XXII) 2000. In: Proceedings of the international conference "The risk in contemporany economy" (2000).

    Google Scholar 

  11. Nikolopoulos, S.D., Papadopoulos, C.: A simple linear-time recognition algorithm for weakly quasi-threshold graphs. Graphs and Combinatorics 27, 567–584 (2011)

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgments

This research was supported by the project entitled Classes of graphs, complexity of problems and algorithms in Bilateral Cooperation by Romanian Academy ("Vasile Alecsandri" University of Bacău is partner) and the National Academy of Sciences of Belarus and Belarusian Republican Foundation for Fundamental Research.

Author information

Authors and Affiliations

  1. Department of Mathematics and Informatics, “Vasile Alecsandri” University of Bacǎu, Str. Calea Marasesti No 157, 600115, Bacǎu, Romania

    Mihai Talmaciu

Authors
  1. Mihai Talmaciu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Mihai Talmaciu .

Editor information

Editors and Affiliations

  1. Petru Maior University, Targu Mures, Romania

    Barna Iantovics

  2. Technical University of Sofia, Sofia, Bulgaria

    Roumen Kountchev

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this chapter

Cite this chapter

Talmaciu, M. (2014). A Recognition Algorithm and Some Optimization Problems on Weakly Quasi-Threshold Graphs. In: Iantovics, B., Kountchev, R. (eds) Advanced Intelligent Computational Technologies and Decision Support Systems. Studies in Computational Intelligence, vol 486. Springer, Cham. https://doi.org/10.1007/978-3-319-00467-9_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-00467-9_18

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-00466-2

  • Online ISBN: 978-3-319-00467-9

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation