Pages that link to "Item:Q5928867"
From MaRDI portal
The following pages link to On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic (Q5928867):
Displayed 14 items.
- Connection Matrices for MSOL-Definable Structural Invariants (Q3601800) (← links)
- (Q4638063) (← links)
- GETGRATS (Q4923529) (← links)
- (Q5009461) (← links)
- Harary polynomials (Q5056203) (← links)
- (Q5091010) (← links)
- A Practical Approach to Courcelle's Theorem (Q5170276) (← links)
- On spectra of sentences of monadic second order logic with counting (Q5311744) (← links)
- Inductive computations on graphs defined by clique-width expressions (Q5321781) (← links)
- On the Expressive Power of Planar Perfect Matching and Permanents of Bounded Treewidth Matrices (Q5387751) (← links)
- Linear Recurrence Relations for Graph Polynomials (Q5452182) (← links)
- Computing LOGCFL certificates (Q5958329) (← links)
- Graph classes and the switch Markov chain for matchings (Q5963358) (← links)
- A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)
