Pages that link to "Item:Q1709594"
From MaRDI portal
The following pages link to Output-polynomial enumeration on graphs of bounded (local) linear MIM-width (Q1709594):
Displayed 13 items.
- Locally definable vertex set properties are efficiently enumerable (Q1983133) (← links)
- Enumerating models of DNF faster: breaking the dependency on the formula size (Q1983134) (← links)
- Efficient enumeration of dominating sets for sparse graphs (Q1983139) (← links)
- On the dualization in distributive lattices and related problems (Q2030249) (← links)
- Counting Minimal Dominating Sets (Q2988832) (← links)
- (Q3459865) (redirect page) (← links)
- Enumerating Minimal Transversals of Hypergraphs without Small Holes (Q5005157) (← links)
- More Applications of the $d$-Neighbor Equivalence: Acyclicity and Connectivity Constraints (Q5009336) (← links)
- Proximity Search for Maximal Subgraph Enumeration (Q5048293) (← links)
- (Q5075752) (← links)
- Enumerating Minimal Dominating Sets in Triangle-Free Graphs (Q5090462) (← links)
- (Q5090998) (← links)
- Node multiway cut and subset feedback vertex set on graphs of bounded mim-width (Q5970812) (← links)