scientific article
From MaRDI portal
Publication:3086928
zbMath1244.03053MaRDI QIDQ3086928
Publication date: 30 March 2011
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Graph theory (including graph drawing) in computer science (68R10) Decidability of theories and sets of sentences (03B25) Graph algorithms (graph-theoretic aspects) (05C85) General topics in the theory of algorithms (68W01)
Related Items (25)
Compactors for parameterized counting problems ⋮ A Retrospective on (Meta) Kernelization ⋮ Vapnik-Chervonenkis dimension and density on Johnson and Hamming graphs ⋮ Kernelization of Cycle Packing with Relaxed Disjointness Constraints ⋮ Unnamed Item ⋮ Preprocessing subgraph and minor problems: when does a small vertex cover help? ⋮ An approval-based model for single-step liquid democracy ⋮ Lower bounds on the complexity of \(\mathsf{MSO}_1\) model-checking ⋮ Large Induced Subgraphs via Triangulations and CMSO ⋮ First-order Logic with Connectivity Operators ⋮ Courcelle's theorem -- a game-theoretic approach ⋮ Feferman-vaught decompositions for prefix classes of first order logic ⋮ Efficient First-Order Model-Checking Using Short Labels ⋮ Lacon-, Shrub- and Parity-Decompositions: Characterizing Transductions of Bounded Expansion Classes ⋮ Compact labelings for efficient first-order model-checking ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Confronting intractability via parameters ⋮ Practical algorithms for MSO model-checking on tree-decomposable graphs ⋮ First-Order Model-Checking in Random Graphs and Complex Networks ⋮ A gentle introduction to applications of algorithmic metatheorems for space and circuit classes ⋮ A Practical Approach to Courcelle's Theorem ⋮ Monadic second-order model-checking on decomposable matroids ⋮ Unnamed Item ⋮ A SAT Approach to Branchwidth
This page was built for publication:
