Labeling algorithms for domination problems in sun-free chordal graphs
- 31 December 1988
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 22 (1) , 21-34
- https://doi.org/10.1016/0166-218x(88)90120-5
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- Domination in permutation graphsJournal of Algorithms, 1985
- Covering, Packing and Generalized PerfectionSIAM Journal on Algebraic Discrete Methods, 1985
- The k-Domination and k-Stability Problems on Sun-Free Chordal GraphsSIAM Journal on Algebraic Discrete Methods, 1984
- Characterizations of totally balanced matricesJournal of Algorithms, 1984
- Domination, independent domination, and duality in strongly chordal graphsDiscrete Applied Mathematics, 1984
- Characterizations of strongly chordal graphsDiscrete Mathematics, 1983
- R-domination on block graphsOperations Research Letters, 1982
- Dominating Sets in Chordal GraphsSIAM Journal on Computing, 1982
- A linear algorithm for the domination number of a treeInformation Processing Letters, 1975
- Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal GraphSIAM Journal on Computing, 1972