Edge search number of cographs (Q415273): 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.1016/j.dam.2011.04.020 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2068664205 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The theory of search games and rendezvous. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds on Edge Searching / 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: Treewidth and Pathwidth of Permutation Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth and Minimum Fill-in on d-Trapezoid Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Pathwidth and Treewidth of Cographs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Node-searching problem on block graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complement reducible graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Recognition Algorithm for Cographs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the vertex separation of unicyclic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical Foundations of Computer Science 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixed Search Number and Linear-Width of Interval and Split Graphs / 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: Q3199182 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3483321 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3351169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some generalizations of the problem on the search number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic graph theory and perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the pathwidth of chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple linear time algorithm for cograph recognition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixed Search Number of Permutation Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge Search Number of Cographs in Linear Time / 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: Recontamination does not help to search a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monotonicity of non-deterministic graph searching / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of searching a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Theoretic Concepts in Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4159394 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge and node searching problems on trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph searching on some subclasses of chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Treewidth and Pathwidth of Biconvex Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Construction of linear tree-layouts which are optimal with respect to vertex separation in linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pathwidth of Circular-Arc Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixed searching and proper-path-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Searching Cycle-Disjoint Graphs / rank
 
Normal rank

Latest revision as of 05:22, 5 July 2024

scientific article
Language Label Description Also known as
English
Edge search number of cographs
scientific article

    Statements

    Edge search number of cographs (English)
    0 references
    0 references
    0 references
    0 references
    11 May 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    graph searching
    0 references
    NP-hard problem
    0 references
    polynomial-time algorithm
    0 references
    graph classes
    0 references
    cographs
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references