Temporal graph classes: a view through temporal separators

DOI10.1007/978-3-030-00256-5_18MaRDI QIDQ6830251zbMATH OpenFDO

Authors Till Fluschnik, Hendrik Molter, Rolf Niedermeier, Philipp Zschoche

Publication date 22 November 2018

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Parameterized complexity, tractability and kernelization (68Q27)

This page was built for publication: Temporal graph classes: a view through temporal separators

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6830251)