On a combinatorial search problem

DOI10.1515/DMA-2002-0403MaRDI QIDQ4809584zbMATH OpenOpenAlexFDO

Authors E. V. Debrev

Publication date 30 August 2004

Published in Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1515/dma-2002-0403

zbMATH Keywords

Hamiltonian circuits

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Eulerian and Hamiltonian graphs (05C45)

Recommendations

• Search problems on graphs
• Combinatorial search in two and more rounds
• A binary search problem on graphs
• Edge search in graphs with restricted test sets
• scientific article; zbMATH DE number 4206026

Cited in

(6)

• A combinatorial search problem on matroids
• On polychotomous search problems
• A combinatorial solution for bridge and torch problem
• scientific article; zbMATH DE number 1738544 (Why is no real title available?)
• scientific article; zbMATH DE number 2097449 (Why is no real title available?)
• A simultaneous search problem

This page was built for publication: On a combinatorial search problem

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