Can Romeo and Juliet meet? Or rendezvous games with adversaries on graphs (Q6116185)

From MaRDI portal
Revision as of 18:35, 30 December 2024 by Import241228121245 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 7713421
Language Label Description Also known as
English
Can Romeo and Juliet meet? Or rendezvous games with adversaries on graphs
scientific article; zbMATH DE number 7713421

    Statements

    Can Romeo and Juliet meet? Or rendezvous games with adversaries on graphs (English)
    0 references
    0 references
    0 references
    0 references
    17 July 2023
    0 references
    rendezvous games
    0 references
    dynamic separators
    0 references
    complexity
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers