Algorithms - ESA 2003
From MaRDI portal
Publication:5897270
DOI10.1007/b13632zbMath1266.68121OpenAlexW1827234103WikidataQ60299159 ScholiaQ60299159MaRDI QIDQ5897270
Publication date: 3 March 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b13632
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (10)
An algorithmic metatheorem for directed treewidth ⋮ Parameterized coloring problems on chordal graphs ⋮ Towards the Graph Minor Theorems for Directed Graphs ⋮ Are there any good digraph width measures? ⋮ On the edge capacitated Steiner tree problem ⋮ Finding a subdivision of a digraph ⋮ Kernels for packing and covering problems ⋮ Almost 2-SAT is fixed-parameter tractable ⋮ Euler Digraphs ⋮ Planar Digraphs
This page was built for publication: Algorithms - ESA 2003
