On the Complexity of Finding an Unknown Cut Via Vertex Queries

DOI10.1007/978-3-540-73545-8_45zbMath1213.68324OpenAlexW1502382854MaRDI QIDQ3608870

Hamid Zarrabi-Zadeh, Peyman Afshani, Arash Farzan, Mehdi Mirzazadeh, Reza Dorrigiv, Narges Simjour, Ehsan Chiniforooshan

Publication date: 6 March 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-73545-8_45

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40)

This page was built for publication: On the Complexity of Finding an Unknown Cut Via Vertex Queries