Pages that link to "Item:Q1801680"
From MaRDI portal
The following pages link to Edge search in graphs and hypergraphs of bounded rank (Q1801680):
Displaying 9 items.
- Edge search number of cographs (Q415273) (← links)
- Realizability and uniqueness in graphs (Q1344609) (← links)
- A parallel algorithm for nearly optimal edge search (Q1350305) (← links)
- Edge search in hypergraphs (Q1356674) (← links)
- Edge ranking of graphs is hard (Q1392547) (← links)
- A group testing problem for hypergraphs of bounded rank (Q1917312) (← links)
- An NP-completeness result of edge search in graphs (Q2014718) (← links)
- Group testing in graphs (Q2471072) (← links)
- Optimal edge ranking of complete bipartite graphs in polynomial time (Q5492694) (← links)
