The Complexity of Acyclic Subhypergraph Problems

DOI10.1007/978-3-642-19094-0_7MaRDI QIDQ3078379zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• On the complexity of some subgraph problems
• scientific article; zbMATH DE number 3910446
• Fundamentals of Computation Theory
• scientific article; zbMATH DE number 3888925
• The dynamic complexity of acyclic hypergraph homomorphisms
• Tight Bounds for the Maximum Acyclic Subgraph Problem
• scientific article; zbMATH DE number 30298
• scientific article; zbMATH DE number 5670148
• On the \(\mathrm{AC}^0\) complexity of subgraph isomorphism
• On the acyclic subgraph polytope

Cites work

• Counting acyclic hypergraphs
• Degrees of acyclicity for hypergraphs and relational database schemes
• Fast Probabilistic Algorithms for Verification of Polynomial Identities
• Fundamentals of Computation Theory
• scientific article; zbMATH DE number 3683635 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1786671 (Why is no real title available?)
• scientific article; zbMATH DE number 784042 (Why is no real title available?)
• scientific article; zbMATH DE number 871942 (Why is no real title available?)
• Matroid matching and some applications
• The statistics of dimers on a lattice. I: The number of dimer arrangements on a quadratic lattice

Cited in

(6)

• scientific article; zbMATH DE number 5670148 (Why is no real title available?)
• On Generating All Maximal Acyclic Subhypergraphs with Polynomial Delay
• On enumerating monomials and other combinatorial structures by polynomial interpolation
• Tight Bounds for the Maximum Acyclic Subgraph Problem
• scientific article; zbMATH DE number 1833409 (Why is no real title available?)
• Fundamentals of Computation Theory

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

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