Linear-time computation of optimal subgraphs of decomposable graphs
- 30 June 1987
- journal article
- Published by Elsevier BV in Journal of Algorithms
- Vol. 8 (2), 216-235
- https://doi.org/10.1016/0196-6774(87)90039-3
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- The irredundance number and maximum degree of a graphDiscrete Mathematics, 1984
- A linear algorithm for the domination number of a series-parallel graphDiscrete Applied Mathematics, 1983
- Linear-time computability of combinatorial problems on series-parallel graphsJournal of the ACM, 1982
- The Recognition of Series Parallel DigraphsSIAM Journal on Computing, 1982
- Contributions to the theory of domination, independence and irredundance in graphsDiscrete Mathematics, 1981
- Graph‐theoretic parameters concerning domination, independence, and irredundanceJournal of Graph Theory, 1979
- Optimum domination in weighted treesInformation Processing Letters, 1978
- b-Matchings in TreesSIAM Journal on Computing, 1976
- A linear algorithm for the domination number of a treeInformation Processing Letters, 1975
- Algorithms for generalized stability numbers of tree graphsJournal of the Australian Mathematical Society, 1966