A Recognition Algorithm and Some Optimization Problems on Weakly Quasi-Threshold Graphs
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 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.
- 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
- 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
- 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