* I wrote following paper where I had taken the indegree inqualities from: _On imposing connectivity constraints in integer programs_
* I read following paper where I had taken the indegree inqualities from: _On imposing connectivity constraints in integer programs_
- This paper references several other papers which deal with the topic. So I've also read the following _An Integer Programming Approach for Fault-Tolerant Connected Dominating Sets_. But they also used the vertex-separator constraints and a lazy approach.
- Their results quite good. So I guess it also makes sense to make some research how the graphs they used "looked like" and what characteristics they had that our graphs not have.
