SOFSEM 2006: Theory and Practice of Computer Science

DOI10.1007/11611257zbMath1175.68197OpenAlexW2756057450MaRDI QIDQ5897983

Stephanie Herrmann, Franz-Josef Brandenburg

Publication date: 14 November 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11611257

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Games involving graphs (91A43) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Positional games (pursuit and evasion, etc.) (91A24)

Related Items (2)

An annotated bibliography on guaranteed graph searching ⋮ The complexity of minimum-length path decompositions

This page was built for publication: SOFSEM 2006: Theory and Practice of Computer Science