Catching a Fast Robber on Interval Graphs (Q3010416): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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.1007/978-3-642-20877-5_35 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1590372461 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3433876 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4398864 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3779759 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pursuing a fast robber on a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Incremental Linear-Time Algorithm for Recognizing Interval Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex-to-vertex pursuit in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A short note about pursuit games played on a graph with a given genus / rank
 
Normal rank

Latest revision as of 05:45, 4 July 2024

scientific article
Language Label Description Also known as
English
Catching a Fast Robber on Interval Graphs
scientific article

    Statements

    Catching a Fast Robber on Interval Graphs (English)
    0 references
    0 references
    1 July 2011
    0 references
    cops and robber game
    0 references
    pursuit game
    0 references
    combinatorial game
    0 references
    interval graph
    0 references
    interval graph representation
    0 references

    Identifiers

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