Pages that link to "Item:Q1281767"
From MaRDI portal
The following pages link to Reconstructing a Hamiltonian cycle by querying the graph: Application to DNA physical mapping (Q1281767):
Displaying 27 items.
- Learning Boolean halfspaces with small weights from membership queries (Q329608) (← links)
- Hamiltonian cycles in linear-convex supergrid graphs (Q335338) (← links)
- Learning a hidden graph (Q479267) (← links)
- The Hamiltonian properties of supergrid graphs (Q497690) (← links)
- Developing a new approach for (biological) optimal control problems: application to optimization of laccase production with a comparison between response surface methodology and novel geometric procedure (Q669182) (← links)
- Learning a hidden uniform hypergraph (Q683922) (← links)
- Reconstruction of hidden graphs and threshold group testing (Q719032) (← links)
- Toward a deterministic polynomial time algorithm with optimal additive query complexity (Q764325) (← links)
- Reconstructing Markov processes from independent and anonymous experiments (Q906437) (← links)
- An upper bound of the number of tests in pooling designs for the error-tolerant complex model (Q941032) (← links)
- Optimal query complexity bounds for finding graphs (Q991004) (← links)
- Nonadaptive algorithms for threshold group testing (Q1028130) (← links)
- Non-adaptive learning of a hidden hypergraph (Q1704557) (← links)
- The Hamiltonian connectivity of rectangular supergrid graphs (Q1751246) (← links)
- Chinese remainder encoding for Hamiltonian cycles (Q2118300) (← links)
- Reconstruction and verification of chordal graphs with a distance oracle (Q2227489) (← links)
- Network construction with subgraph connectivity constraints (Q2253960) (← links)
- Reconstructing weighted graphs with minimal query complexity (Q2431425) (← links)
- An unexpected meeting of four seemingly unrelated problems: graph testing, DNA complex screening, superimposed codes and secure key distribution (Q2471071) (← links)
- Exact learning from an honest teacher that answers membership queries (Q2636406) (← links)
- Non-adaptive Learning of a Hidden Hypergraph (Q2835619) (← links)
- Linear Time Constructions of Some $$d$$-Restriction Problems (Q2947011) (← links)
- Learning and Verifying Graphs Using Queries with a Focus on Edge Counting (Q3520066) (← links)
- Reconstructing Weighted Graphs with Minimal Query Complexity (Q3648745) (← links)
- (Q5005098) (← links)
- (Q5136326) (← links)
- On Parity Check (0,1)-Matrix over $\mathbb{Z}_p$ (Q5251659) (← links)
