On the independent dominating set polytope

DOI10.1016/j.ejc.2004.07.015zbMath1086.05057OpenAlexW2028802515MaRDI QIDQ2368719

Ali Ridha Mahjoub, Jean Mailfert

Publication date: 28 April 2006

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2004.07.015

zbMATH Keywords

cycleplane algorithm

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items

On the independent dominating set polytope ⋮ The weakly connected independent set polytope in corona and join of graphs ⋮ Minimum weight clustered dominating tree problem ⋮ The minimum weakly connected independent set problem: polyhedral results and branch-and-cut

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• Domination, independent domination, and duality in strongly chordal graphs
• Clustering and domination in perfect graphs
• On domination problems for permutation and other graphs
• A unified approach to domination problems on interval graphs
• The ellipsoid method and its consequences in combinatorial optimization
• Independent domination in chordal graphs
• One-node cutsets and the dominating set polytope
• Independent domination in finitely defined classes of graphs
• On the independent dominating set polytope
• On the dominating set polytope
• Domination on Cocomparability Graphs
• Polytope Des Absorbants Dans Une Classe De Graphe a Seuil
• Domination in permutation graphs
• Edge Dominating Sets in Graphs
• Of Stable Marriages and Graphs, and Strategy and Polytopes