On the Complexity of Some Ordering Problems

DOI10.1007/978-3-662-44465-8_11zbMath1426.68112OpenAlexW2184530580MaRDI QIDQ2922601

Beate Bollig

Publication date: 14 October 2014

Published in: Mathematical Foundations of Computer Science 2014 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-44465-8_11

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) Data structures (68P05)

Related Items (3)

Boolean polynomials, BDDs and CRHS equations -- connecting the dots with CryptaPath ⋮ On the OBDD representation of some graph classes ⋮ On the minimization of (complete) ordered binary decision diagrams

This page was built for publication: On the Complexity of Some Ordering Problems