Pages that link to "Item:Q991004"
From MaRDI portal
The following pages link to Optimal query complexity bounds for finding graphs (Q991004):
Displaying 15 items.
- Relative expressive power of navigational querying on graphs (Q528686) (← links)
- Almost tight upper bound for finding Fourier coefficients of bounded pseudo-Boolean functions (Q657913) (← links)
- Network verification via routing table queries (Q743125) (← links)
- Toward a deterministic polynomial time algorithm with optimal additive query complexity (Q764325) (← links)
- On triangle estimation using tripartite independent set queries (Q825973) (← links)
- Query efficient implementation of graphs of bounded clique-width (Q1408820) (← links)
- Generalized framework for group testing: queries, feedbacks and adversaries (Q2136279) (← links)
- A divide-and-conquer approach for reconstruction of \(\{C_{ \geq 5}\}\)-free graphs via betweenness queries (Q2143136) (← links)
- Linear time construction of indexable elastic founder graphs (Q2169983) (← links)
- Reconstructing weighted graphs with minimal query complexity (Q2431425) (← links)
- Exact learning from an honest teacher that answers membership queries (Q2636406) (← links)
- Optimal Query Complexity for Reconstructing Hypergraphs (Q3113744) (← links)
- (Q4369618) (← links)
- (Q4430138) (← links)
- (Q5874464) (← links)
