Edge search in hypergraphs

DOI10.1016/0012-365X(95)00291-4MaRDI QIDQ1356674zbMATH OpenFDO

Authors Ingo Althöfer, M. Löwe

Publication date 10 June 1997

Published in Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

hypergraphprobability distributionedge search

Mathematics Subject Classification ID

Hypergraphs (05C65)

Recommendations

• Edge search in graphs and hypergraphs of bounded rank
• A group testing problem for hypergraphs of bounded rank
• Searching for an edge in a graph
• Learning Theory

Cites work

• scientific article; zbMATH DE number 4057247 (Why is no real title available?)
• scientific article; zbMATH DE number 41347 (Why is no real title available?)
• scientific article; zbMATH DE number 3637904 (Why is no real title available?)
• scientific article; zbMATH DE number 823957 (Why is no real title available?)
• A tight upper bound for group testing in graphs
• Edge search in graphs and hypergraphs of bounded rank
• Realizability and uniqueness in graphs
• Search problems on graphs

Cited in

(4)

• An NP-completeness result of edge search in graphs
• Edge search number of cographs
• Edge search in graphs and hypergraphs of bounded rank
• A group testing problem for hypergraphs of bounded rank

This page was built for publication: Edge search in hypergraphs

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