On the dominating set polytope
- 30 April 2008
- journal article
- Published by Elsevier in European Journal of Combinatorics
- Vol. 29 (3) , 652-661
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- One-node cutsets and the dominating set polytopeDiscrete Mathematics, 1997
- Facets and lifting procedures for the set covering polytopeMathematical Programming, 1989
- A linear algorithm for finding a minimum dominating set in a cactusDiscrete Applied Mathematics, 1986
- Domination in permutation graphsJournal of Algorithms, 1985
- Domination, independent domination, and duality in strongly chordal graphsDiscrete Applied Mathematics, 1984
- A linear algorithm for the domination number of a series-parallel graphDiscrete Applied Mathematics, 1983
- Characterizations of strongly chordal graphsDiscrete Mathematics, 1983
- The ellipsoid method and its consequences in combinatorial optimizationCombinatorica, 1981
- Towards a theory of domination in graphsNetworks, 1977
- On a routing problemQuarterly of Applied Mathematics, 1958