Просмотр коллекции по группе - По тематике DIRECTED GRAPHS
Отображение результатов 1 до 8 из 8
| Дата публикации | Название | Авторы |
| 2022 | Binary Completely Reachable Automata | Casas, D.; Volkov, M. V. |
| 2018 | A Characterization of Completely Reachable Automata | Bondar, E. A.; Volkov, M. V. |
| 2021 | Directed graph mapping exceeds phase mapping in discriminating true and false rotors detected with a basket catheter in a complex in-silico excitation pattern | Van, Nieuwenhuyse, E.; Martinez-Mateu, L.; Saiz, J.; Panfilov, A. V.; Vandersickel, N. |
| 2011 | Efficient Algorithm for Finding Minimal Spanning Tree in Directed Graphs With Integer-Valued Weights | Tolkacheva, A. |
| 2012 | The hamiltonian alternating path problem | Gorbenko, Anna; Popov, Vladimir |
| 2015 | On the number of synchronizing colorings of digraphs | Gusev, V. V.; Szykuła, M. |
| 2022 | A Problem-Specific Branch-and-Bound Algorithm for the Protected Shortest Simple Path Problem with Must-Pass Nodes | Ogorodnikov, Y.; Rudakov, R.; Khachai, D.; Khachay, M. |
| 2014 | Reset thresholds of automata with two cycle lengths | Gusev, V. V.; Pribavkina, E. V. |
