Contraction obstructions for connected graph searching (Q298950): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(9 intermediate revisions by 8 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.dam.2015.07.036 / rank
Normal rank
 
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C40 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C85 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6595944 / rank
 
Normal rank
Property / zbMATH Keywords
 
graph searching
Property / zbMATH Keywords: graph searching / rank
 
Normal rank
Property / zbMATH Keywords
 
graph contractions
Property / zbMATH Keywords: graph contractions / rank
 
Normal rank
Property / zbMATH Keywords
 
obstruction set
Property / zbMATH Keywords: obstruction set / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1717727751 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1410.8756 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connected graph searching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Theoretic Concepts in Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monotonicity in graph searching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized and Exact Computation / 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: From Pathwidth to Connected Pathwidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the monotonicity of games generated by symmetric submodular functions. / 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: Monotony Properties of Connected Visible Graph Searching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Obstruction set isolation for the gate matrix layout problem / 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: Graph minors. I. Excluding a forest / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. II. Algorithmic aspects of tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. XIII: The disjoint paths problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. XX: Wagner's conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph searching and a min-max theorem for tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal acyclic forbidden minors for the family of graphs with bounded path-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and obstructions for linear-width and related search parameters / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DAM.2015.07.036 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:44, 9 December 2024

scientific article
Language Label Description Also known as
English
Contraction obstructions for connected graph searching
scientific article

    Statements

    Contraction obstructions for connected graph searching (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    21 June 2016
    0 references
    graph searching
    0 references
    graph contractions
    0 references
    obstruction set
    0 references

    Identifiers