scientific article
From MaRDI portal
Publication:3113705
DOI10.4230/LIPIcs.STACS.2011.404zbMath1230.68109MaRDI QIDQ3113705
Robert Ganian, Jan Obdržálek, Petr Hliněný
Publication date: 23 January 2012
Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_2221.html
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Directed graphs (digraphs), tournaments (05C20)
Related Items (7)
Fast exact algorithms for some connectivity problems parameterized by clique-width ⋮ Are there any good digraph width measures? ⋮ Directed NLC-width ⋮ Digraph width measures in parameterized algorithmics ⋮ An optimal XP algorithm for Hamiltonian cycle on graphs of bounded clique-width ⋮ On width measures and topological problems on semi-complete digraphs ⋮ Unnamed Item
This page was built for publication:
