Connected graph searching (Q690489)

From MaRDI portal
Revision as of 22:54, 5 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Connected graph searching
scientific article

    Statements

    title
    Connected graph searching (English)
    0 references
    author
    Lali Barrière
    0 references
    Paola Flocchini
    0 references
    Fedor V. Fomin
    0 references
    Pierre Fraigniaud
    0 references
    Nicolas Nisse
    0 references
    Nicola Santoro
    0 references
    Dimitrios M. Thilikos
    0 references
    publication date
    27 November 2012
    0 references
    zbMATH DE Number
    6110705
    0 references
    zbMATH Keywords
    graph searching
    0 references
    cops-and-robbers
    0 references
    network security
    0 references
    OpenAlex ID
    W2053218689
    0 references
    Wikidata QID
    Q60488463
    0 references
    cites work
    Q3477966
    0 references
    Searching and pebbling
    0 references
    Eavesdropping games
    0 references
    Q4159394
    0 references
    Q3208679
    0 references
    Q4035355
    0 references
    Q4542534
    0 references
    Q3113706
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q690489&oldid=35309874"
    Powered by MediaWiki