Advertisement

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

  • Mihai Talmaciu
Chapter
Part of the Studies in Computational Intelligence book series (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.

Notes

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.

References

  1. 1.
    Corneil, D.G., Lerchs, H., Stewart, L.K.: Complement reducible graphs. Discrete Appl. Math. 3, 163–174 (1981)MathSciNetCrossRefMATHGoogle Scholar
  2. 2.
    Bapat, R.B., Lal, A.K., Pati, S.: Laplacian spectrum of weakly quasi-threshold graphs. Graphs and Combinatorics 24, 273–290 (2008)MathSciNetCrossRefMATHGoogle Scholar
  3. 3.
    Corneil, D.G., Perl, Y., Stewart, L.K.: A linear recognition algorithm for cographs. SIAM J. Comput. 14, 926–934 (1985)MathSciNetCrossRefMATHGoogle Scholar
  4. 4.
    Brandstadt, A., Le, V.B., Spinrad, J.P.: Graph classes: a survey, SIAM Monographs on, Discrete Mathematics and Applications (1999).Google Scholar
  5. 5.
    Golumbic, M.C.: Algorithmic graph theory and perfect graphs. Second edition. Annals of Discrete Mathematics, vol. 57, Elsevier, Amsterdam (2004).Google Scholar
  6. 6.
    Berge, C.: Graphs. Nort-Holland, Amsterdam (1985)MATHGoogle Scholar
  7. 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. 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. 9.
    Talmaciu, M., Nechita, E.: Recognition algorithm for diamond-free graphs. Informatica 18(3), 457–462 (2007)MathSciNetMATHGoogle Scholar
  10. 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. 11.
    Nikolopoulos, S.D., Papadopoulos, C.: A simple linear-time recognition algorithm for weakly quasi-threshold graphs. Graphs and Combinatorics 27, 567–584 (2011)MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  1. 1.Department of Mathematics and Informatics“Vasile Alecsandri” University of BacǎuBacǎuRomania

Personalised recommendations