scientific article; zbMATH DE number 1405654
From MaRDI portal
Publication:4938635
zbMath0939.03010MaRDI QIDQ4938635
Publication date: 23 February 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
decidabilitylinear time algorithmtree-widthfirst-order definable graph propertylocally tree-decomposable graphs
Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Decidability of theories and sets of sentences (03B25)
Related Items
Compactors for parameterized counting problems ⋮ On the Parameterized Complexity of the Expected Coverage Problem ⋮ On the parameterized complexity of the expected coverage problem ⋮ Analysis and application of adaptive sampling ⋮ Confronting intractability via parameters ⋮ Unnamed Item ⋮ Parameterized counting problems