Pages that link to "Item:Q967312"
From MaRDI portal
The following pages link to Linear delay enumeration and monadic second-order logic (Q967312):
Displaying 20 items.
- On enumerating monomials and other combinatorial structures by polynomial interpolation (Q385504) (← links)
- An incremental polynomial time algorithm to enumerate all minimal edge dominating sets (Q494806) (← links)
- Monadic second-order model-checking on decomposable matroids (Q548278) (← links)
- Enumerating minimal dominating sets in chordal bipartite graphs (Q896653) (← links)
- Cograph generation with linear delay (Q1694670) (← links)
- Output-polynomial enumeration on graphs of bounded (local) linear MIM-width (Q1709594) (← links)
- Compact representation for answer sets of \(n\)-ary regular queries (Q1959656) (← 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)
- Refined notions of parameterized enumeration kernels with applications to matching cut enumeration (Q2237892) (← links)
- Structural tractability of enumerating CSP solutions (Q2342585) (← links)
- A Polynomial Delay Algorithm for Enumerating Minimal Dominating Sets in Chordal Graphs (Q2827808) (← links)
- Counting Minimal Dominating Sets (Q2988832) (← links)
- Enumeration of Minimal Dominating Sets and Variants (Q3088292) (← links)
- Enumeration on trees under relabelings (Q3305348) (← links)
- Computing the<i>j</i>th solution of a first-order query (Q3514640) (← links)
- Enumerating Minimal Dominating Sets in Triangle-Free Graphs (Q5090462) (← links)
- (Q5090998) (← links)
- (Q5094135) (← links)
