FAST ALGORITHMS OF DUALLY CHORDAL GRAPHS
MIHAI TALMACIU
Department of Mathematics, Informatics and Education Sciences, Faculty of Sciences, "Vasile Alecsandri" University of Bacău, Calea Mărăşeşti 157, Bacău 600115, ROMANIA, e-mail: mtalmaciu@ub.ro, mihaitalmaciu@yahoo.com
Abstract
We give a characterization of hereditary dually chordal graphs using weak decomposition. We also give a recognition algorithm for hereditary dually chordal graphs and we determine the combinatorial optimization numbers in efficient time.