Skip to main content
Top

2014 | OriginalPaper | Chapter

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

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

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.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literature
2.
go back to reference Bapat, R.B., Lal, A.K., Pati, S.: Laplacian spectrum of weakly quasi-threshold graphs. Graphs and Combinatorics 24, 273–290 (2008)MathSciNetCrossRefMATH Bapat, R.B., Lal, A.K., Pati, S.: Laplacian spectrum of weakly quasi-threshold graphs. Graphs and Combinatorics 24, 273–290 (2008)MathSciNetCrossRefMATH
4.
go back to reference Brandstadt, A., Le, V.B., Spinrad, J.P.: Graph classes: a survey, SIAM Monographs on, Discrete Mathematics and Applications (1999). Brandstadt, A., Le, V.B., Spinrad, J.P.: Graph classes: a survey, SIAM Monographs on, Discrete Mathematics and Applications (1999).
5.
go back to reference Golumbic, M.C.: Algorithmic graph theory and perfect graphs. Second edition. Annals of Discrete Mathematics, vol. 57, Elsevier, Amsterdam (2004). Golumbic, M.C.: Algorithmic graph theory and perfect graphs. Second edition. Annals of Discrete Mathematics, vol. 57, Elsevier, Amsterdam (2004).
7.
go back to reference Croitoru, C., Talmaciu, M.: A new graph search algorithm and some applications, presented at ROSYCS 2000, Alexandru Ioan Cuza University of Iaşi (2000). Croitoru, C., Talmaciu, M.: A new graph search algorithm and some applications, presented at ROSYCS 2000, Alexandru Ioan Cuza University of Iaşi (2000).
8.
go back to reference Talmaciu, M.: Decomposition problems in the graph theory with applications in combinatorial optimization. PhD. Thesis, Alexandru Ioan Cuza University of Iasi, Romania (2002). Talmaciu, M.: Decomposition problems in the graph theory with applications in combinatorial optimization. PhD. Thesis, Alexandru Ioan Cuza University of Iasi, Romania (2002).
9.
go back to reference Talmaciu, M., Nechita, E.: Recognition algorithm for diamond-free graphs. Informatica 18(3), 457–462 (2007)MathSciNetMATH Talmaciu, M., Nechita, E.: Recognition algorithm for diamond-free graphs. Informatica 18(3), 457–462 (2007)MathSciNetMATH
10.
go back to reference 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). 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).
11.
go back to reference Nikolopoulos, S.D., Papadopoulos, C.: A simple linear-time recognition algorithm for weakly quasi-threshold graphs. Graphs and Combinatorics 27, 567–584 (2011)MathSciNetCrossRef Nikolopoulos, S.D., Papadopoulos, C.: A simple linear-time recognition algorithm for weakly quasi-threshold graphs. Graphs and Combinatorics 27, 567–584 (2011)MathSciNetCrossRef
Metadata
Title
A Recognition Algorithm and Some Optimization Problems on Weakly Quasi-Threshold Graphs
Author
Mihai Talmaciu
Copyright Year
2014
DOI
https://doi.org/10.1007/978-3-319-00467-9_18

Premium Partner