Connected graph searching (Q690489): Difference between revisions

From MaRDI portal
m rollbackEdits.php mass rollback
Tag: Rollback
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ic.2012.08.004 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2053218689 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q60488463 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expander graphs and their applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of searching a graph / 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: Q3477966 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Searching and pebbling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eavesdropping games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized hypertree decompositions: NP-hardness and tractable variants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4159394 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3208679 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interval graphs and searching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. XX: Wagner's conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monotonicity in graph searching / 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: On the monotonicity of games generated by symmetric submodular functions. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sweeping graphs with large clique number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nondeterministic graph searching: from pathwidth to treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized and Exact Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonconstructive tools for proving polynomial-time decidability / 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. X: Obstructions to tree-decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of registers required for evaluating arithmetic expressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some mathematical properties of branching trees with application to the respiratory system / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Theoretic Concepts in Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connected Graph Searching in Outerplanar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connected Treewidth and Connected Graph Searching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connected graph searching in chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: BOUNDARY-OPTIMAL TRIANGULATION FLOODING / 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: Distributed chasing of network intruders / rank
 
Normal rank
Property / cites work
 
Property / cites work: DECONTAMINATING CHORDAL RINGS AND TORI USING MOBILE AGENTS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decontamination of hypercubes by mobile agents / rank
 
Normal rank
Property / cites work
 
Property / cites work: The cost of monotonicity in distributed graph searching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph searching with advice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4035355 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Call routing and the ratcatcher / rank
 
Normal rank
Property / cites work
 
Property / cites work: On embedding trees into uniformly convex Banach spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542534 / 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: Pathwidth is NP-Hard for Weighted Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: From Pathwidth to Connected Pathwidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connected searching of weighted trees / rank
 
Normal rank

Latest revision as of 22:54, 5 July 2024

scientific article
Language Label Description Also known as
English
Connected graph searching
scientific article

    Statements

    Connected graph searching (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    27 November 2012
    0 references
    0 references
    graph searching
    0 references
    cops-and-robbers
    0 references
    network security
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references