INVESTIGATIONS ON THE BISECTION PROBLEM

  • MIHAI TALMACIU
    “Vasile Alecsandri" University of Bacău, Faculty of Sciences, Department of Mathematics, Informatics and Educational Sciences, Calea Mărăşeşti 157, Bacău 600115, Romania
    mtalmaciu@ub.ro

Abstract

In this paper we characterize threshold graphs using the weakly decomposition, give a recognition algorithm for this class of graphs and an algorithm for the bisection problem in threshold graphs.

Cuvinte cheie

Threshold graphs weakly decomposition recognition algorithm bisection problem