Automata, Languages and Programming

DOI10.1007/11523468zbMath1085.68582OpenAlexW2940595899WikidataQ56656999 ScholiaQ56656999MaRDI QIDQ5716833

No author found.

Publication date: 10 January 2006

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

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

Mathematics Subject Classification ID

Database theory (68P15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Related Items (2)

Partitioning \(P_4\)-tidy graphs into a stable set and a forest ⋮ Acyclic subgraphs of planar digraphs

This page was built for publication: Automata, Languages and Programming