Helicopter search problems, bandwidth and pathwidth (Q1392549): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q259035
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Fedor V. Fomin / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: A game of cops and robbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a pursuit game played on graphs for which a minor is excluded / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the cop number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4035355 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A partial k-arboretum of graphs with bounded treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single step graph search problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The bandwidth problem for graphs and matrices—a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some pursuit-evasion problems on grids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fugitive-search games on graphs and related parameters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4387698 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity Results for Bandwidth Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3484665 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interval graphs and searching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Searching and pebbling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Narrowness, pathwidth, and their application in natural language processing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recontamination does not help to search a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Black-white pebbles and graph separation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topological Bandwidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Algorithm for Topological Bandwidth in Degree-Three Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3477966 / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-dimensional logic gate assignment and interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4159394 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3959776 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3363112 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. I. Excluding a forest / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Algorithms for a Pursuit-Evasion Problem in Grids / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2029460394 / rank
 
Normal rank

Latest revision as of 08:47, 30 July 2024

scientific article
Language Label Description Also known as
English
Helicopter search problems, bandwidth and pathwidth
scientific article

    Statements

    Helicopter search problems, bandwidth and pathwidth (English)
    0 references
    28 July 1998
    0 references
    bandwidth
    0 references
    computational complexity
    0 references
    search problem
    0 references
    0 references

    Identifiers