Skip to content
Descubridor Institucional UMAR
Inicio
Búsqueda avanzada
Explorar
Inicio
Búsqueda avanzada
Explorar
Login
Language
English
Deutsch
Español
Français
Italiano
All Fields
Title
Author
Subject
Call Number
ISBN/ISSN
Tag
Find
Advanced
Monte Carlo tree search for dynamic shortest‐path interdiction
Monte Carlo tree search for dynamic shortest‐path interdiction
Fuente:
Wiley Open Access
Saved in:
Bibliographic Details
Main Authors:
Alexey A. Bochkarev
,
J. Cole Smith
Format:
Artículo Open Access
Published:
Wiley
2024
Subjects:
Networks
Online Access:
Acceder al recurso
Tags:
Add Tag
No Tags, Be the first to tag this record!
Cite this
Text this
Email this
Print
Export Record
Export to RefWorks
Export to EndNoteWeb
Export to EndNote
Save to List
Permanent link
Holdings
Description
Comments
Similar Items
Staff View
Internet
https://onlinelibrary.wiley.com/doi/10.1002/net.22243
Similar Items
Higher-order shortest paths in hypergraphs
by: Nortier, Berné L., et al.
Published: (2025)
Local network evolution rules drive shortest path multiplicity
by: Vazquez, Alexei
Published: (2026)
Relations between average shortest path length and another centralities in graphs
by: Tuzhilin, Mikhail
Published: (2024)
Phase space path integral representation of the dynamic structure factor. Monte Carlo simulation of strongly correlated soft-sphere fermions
by: Filinov, V. S., et al.
Published: (2024)
Faster shortest-path algorithms using the acyclic-connected tree
by: Stefansson, Elis, et al.
Published: (2025)