scientific article
From MaRDI portal
Publication:2908838
DOI10.4230/LIPIcs.FSTTCS.2010.73zbMath1245.68108MaRDI QIDQ2908838
Robert Ganian, Jan Obdržálek, Petr Hliněný
Publication date: 29 August 2012
Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_eca3.html
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (5)
The rank-width of edge-coloured graphs ⋮ Satisfiability of acyclic and almost acyclic CNF formulas ⋮ Automata for the verification of monadic second-order graph properties ⋮ Satisfiability of Acyclic and almost Acyclic CNF Formulas (II) ⋮ Backdoors to q-Horn
This page was built for publication:
