scientific article
From MaRDI portal
Publication:2861547
zbMath1274.90444MaRDI QIDQ2861547
M. E. Ugarte, Gabriela R. Argiroffo, Mariana S. Escalante
Publication date: 8 November 2013
Full work available at URL: http://www.sciencedirect.com/science/article/pii/S1571065310001484
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- A construction for non-rank facets of stable set polytopes of webs
- A linear algorithm for finding a minimum dominating set in a cactus
- On the set covering polytope. I: All the facets with coefficients in \(\{\) 0,1,2\(\}\)
- On the facial structure of the set covering polytope
- One-node cutsets and the dominating set polytope
- A linear algorithm for the domination number of a series-parallel graph
- On the dominating set polytope
- Almost all webs are not rank-perfect
- Limited Packings in Graphs
This page was built for publication:
