On Generating All Maximal Acyclic Subhypergraphs with Polynomial Delay

DOI10.1007/978-3-540-95891-8_19zbMath1206.68230OpenAlexW1579334139MaRDI QIDQ3599072

Taishin Daigo, Kouichi Hirata

Publication date: 3 February 2009

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

Full work available at URL: https://doi.org/10.1007/978-3-540-95891-8_19

Mathematics Subject Classification ID

Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• Unnamed Item
• Unnamed Item
• On generating all maximal independent sets
• On hypergraph acyclicity and graph chordality
• Conjunctive query containment revisited
• On the Desirability of Acyclic Database Schemes
• Degrees of acyclicity for hypergraphs and relational database schemes
• The complexity of acyclic conjunctive queries
• Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
• Finding All Spanning Trees of Directed and Undirected Graphs
• An Optimal Algorithm for Scanning All Spanning Trees of Undirected Graphs
• Algorithms for Enumerating All Spanning Trees of Undirected and Weighted Graphs
• Frequent Hypergraph Mining
• Fundamentals of Computation Theory

This page was built for publication: On Generating All Maximal Acyclic Subhypergraphs with Polynomial Delay