The fast search number of a Cartesian product of graphs (Q526821): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C76 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C57 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 91A43 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 91A24 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6715556 / rank
 
Normal rank
Property / zbMATH Keywords
 
graph searching
Property / zbMATH Keywords: graph searching / rank
 
Normal rank
Property / zbMATH Keywords
 
fast searching
Property / zbMATH Keywords: fast searching / rank
 
Normal rank
Property / zbMATH Keywords
 
Cops and Robber game
Property / zbMATH Keywords: Cops and Robber game / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2017.03.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2604377131 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3418339 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4035355 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monotonicity in graph searching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3090934 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The treewidth and pathwidth of hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three-fast-searchable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Fast Searching Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An annotated bibliography on guaranteed graph searching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5445040 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Searching and pebbling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topological Bandwidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of searching a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4159394 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast searching games on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Searching on Complete k-partite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast edge searching and fast searching on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast-mixed searching and related problems on graphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 19:12, 13 July 2024

scientific article
Language Label Description Also known as
English
The fast search number of a Cartesian product of graphs
scientific article

    Statements

    The fast search number of a Cartesian product of graphs (English)
    0 references
    0 references
    0 references
    15 May 2017
    0 references
    graph searching
    0 references
    fast searching
    0 references
    Cops and Robber game
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references