Pages that link to "Item:Q930604"
From MaRDI portal
The following pages link to Generating cut conjunctions in graphs and related problems (Q930604):
Displaying 9 items.
- Reflections on generating (disjunctive) cuts (Q458126) (← links)
- An incremental polynomial time algorithm to enumerate all minimal edge dominating sets (Q494806) (← links)
- Enumerating minimal dominating sets in chordal bipartite graphs (Q896653) (← links)
- Scientific contributions of Leo Khachiyan (a short overview) (Q944704) (← links)
- Polynomial Delay Algorithm for Listing Minimal Edge Dominating Sets in Graphs (Q3449842) (← links)
- (Q4537754) (← links)
- Enumerating Minimal Transversals of Hypergraphs without Small Holes (Q5005157) (← links)
- (Q5089231) (← links)
- Efficient constant-factor approximate enumeration of minimal subsets for monotone properties with weight constraints (Q6657233) (← links)
