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
Complexity Results for a Cops and Robber Game on Directed Graphs
Complexity Results for a Cops and Robber Game on Directed Graphs
Fuente:
Wiley Open Access
Saved in:
Bibliographic Details
Main Authors:
Walid Ben‐Ameur
,
Alessandro Maddaloni
Format:
Artículo Open Access
Published:
Wiley
2025
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
Be the first to leave a comment!
Your Comment
You must be logged in first
Similar Items
A cops and robber game and the meeting time of synchronous directed walks
by: Walid Ben‐Ameur, et al.
Published: (2024)
Complexity results for a cops and robber game on directed graphs
by: Ben-Ameur, Walid, et al.
Published: (2024)
Hunting a rabbit: complexity, approximability and some characterizations
by: Ben-Ameur, Walid, et al.
Published: (2025)
Cops and Robbers for Graphs on Surfaces with Crossings
by: Bose, Prosenjit, et al.
Published: (2025)
Cops and Robbers on Graphs with Path Constraints
by: Clow, Alexander, et al.
Published: (2025)
