On computing the frequencies of induced subhypergraphs

DOI10.1137/090752961MaRDI QIDQ3084228zbMATH OpenOpenAlexFDO

Authors B. Nagle

Publication date 15 March 2011

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/4c42ade852b0d7c4429b22b5d6bdceca00ef774e

zbMATH Keywords

counting algorithmshypergraphsinduced containment

Mathematics Subject Classification ID

Hypergraphs (05C65) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• Finding and counting cliques and independent sets in \(r\)-uniform hypergraphs
• A Fast Approximation Algorithm for Computing the Frequencies of Subgraphs in a Given Graph
• scientific article; zbMATH DE number 2086691
• Induced universal hypergraphs
• Computing the number of induced copies of a fixed graph in a bounded degree graph

Cited in

(5)

• Computing the number of induced copies of a fixed graph in a bounded degree graph
• A Fast Approximation Algorithm for Computing the Frequencies of Subgraphs in a Given Graph
• Faster combinatorial k-clique algorithms
• A criterion for Andrásfai-Erdős-Sós type theorems and applications
• Finding and counting cliques and independent sets in \(r\)-uniform hypergraphs

This page was built for publication: On computing the frequencies of induced subhypergraphs

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