Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Edge search in hypergraphs

From MaRDI portal
Publication:1356674
Jump to:navigation, search

DOI10.1016/0012-365X(95)00291-4zbMath0874.05040MaRDI QIDQ1356674

Ingo Althöfer, Matthias Loewe

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)


Related Items (1)

A group testing problem for hypergraphs of bounded rank




Cites Work

  • Search problems on graphs
  • A tight upper bound for group testing in graphs
  • Realizability and uniqueness in graphs
  • Edge search in graphs and hypergraphs of bounded rank
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item




This page was built for publication: Edge search in hypergraphs

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1356674&oldid=13496063"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 14:27.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki