Fundamentals of Computation Theory
From MaRDI portal
Publication:5492954
DOI10.1007/11537311zbMath1123.68091OpenAlexW2491671784MaRDI QIDQ5492954
Kouichi Hirata, Masateru Harao, Megumi Kuwabara
Publication date: 20 October 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11537311
Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (3)
Computing partial hypergraphs of bounded width ⋮ On Generating All Maximal Acyclic Subhypergraphs with Polynomial Delay ⋮ The Complexity of Acyclic Subhypergraph Problems
This page was built for publication: Fundamentals of Computation Theory
