The Complexity of Acyclic Subhypergraph Problems

DOI10.1007/978-3-642-19094-0_7zbMath1317.68067OpenAlexW1546645372MaRDI QIDQ3078379

David Duris, Yann Strozecki

Publication date: 20 February 2011

Published in: WALCOM: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-19094-0_7

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Hypergraphs (05C65) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

On enumerating monomials and other combinatorial structures by polynomial interpolation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Matroid matching and some applications
• Counting acyclic hypergraphs
• The statistics of dimers on a lattice
• Degrees of acyclicity for hypergraphs and relational database schemes
• Fast Probabilistic Algorithms for Verification of Polynomial Identities
• Fundamentals of Computation Theory

This page was built for publication: The Complexity of Acyclic Subhypergraph Problems