An annotated bibliography on guaranteed graph searching (Q930895): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 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.tcs.2008.02.040 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2106518318 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q60488721 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Marshals, monotone marshals, and hypertree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3576650 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Theoretic Concepts in Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: A game of cops and robbers / 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: Q3418339 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arc Searching Digraphs Without Jumping / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds on Edge Searching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on a pursuit game played on graphs / 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: Q5700702 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5421309 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On bridged graphs and cop-win graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Finding Embeddings in a <i>k</i>-Tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Directed path-width and monotonicity in digraph 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: On the cop number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: DAG-Width and Parity Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4035355 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quickly excluding a forest / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monotonicity in 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: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth / 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: Parameterized and Exact Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: SOFSEM 2006: Theory and Practice of Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gibbs measures and dismantlable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single step graph search problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On constructible graphs, infinite bridged graphs and weakly cop-win graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bridged graphs are cop-win graphs: An algorithmic proof / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4677834 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5310227 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4552216 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2770438 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Tandem version of the Cops and Robber Game played on products of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tandem-win graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: SEARCHING FOR A MOBILE INTRUDER IN A CORRIDOR —THE OPEN EDGE VARIANT OF THE POLYGON SEARCH PROBLEM / 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: Q4472697 / 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: The vertex separation and search number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5460876 / 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: A search problem on a graph under restriction of the velocity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The search for the evader on 3-minimal trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Search problem on trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost discrete search programs on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Helicopter search problems, bandwidth and pathwidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on a helicopter search problem on 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: Graph Searching and Interval Completion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4396114 / 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: Graph searching, elimination trees, and a generalization of bandwidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the domination search number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4387698 / 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: 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: Monotony Properties of Connected Visible Graph Searching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cops and robbers in graphs with large girth and Cayley graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a pursuit game on Cayley graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eavesdropping games / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of pursuit on a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818815 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3489816 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3484665 / 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: Q4029792 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2782692 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4722115 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(k\)-search number of graphs of regular polyhedra / 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: Q5754055 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Theoretic Concepts in Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robbers, marshals, and guards: Game theoretic and logical characterizations of hypertree width. / 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: Constraint solving via fractional edge covers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5445040 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On cop-win graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on \(k\)-cop, \(l\)-robber games on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a pursuit game on Cayley digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the single step graph searching problem by solving the maximum two-independent set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The summation and bottleneck minimization for single-step searching on weighted graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single step searching in weighted block graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934648 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5532185 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Directed tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Search problems in graphs with counteraction. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The vertex separation number of a graph equals its path-width / 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: AN ALGORITHM FOR SEARCHING A POLYGONAL REGION WITH A FLASHLIGHT / rank
 
Normal rank
Property / cites work
 
Property / cites work: NETWORK DECONTAMINATION IN PRESENCE OF LOCAL IMMUNITY / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a game of policemen and robber / rank
 
Normal rank
Property / cites work
 
Property / cites work: On minimizing width in linear layouts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topological Bandwidth / 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: Q3477966 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4489244 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A game of cops and robbers played on products of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4881856 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A pursuit-evasion problem on a grid / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connected graph searching in chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Searching with Advice / 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: Search and sweep numbers of finite directed acyclic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: BOUNDARY-OPTIMAL TRIANGULATION FLOODING / rank
 
Normal rank
Property / cites work
 
Property / cites work: DAG-width / 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: 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: Q3959776 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3035170 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4371176 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Search problems on graphs of regular polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: On certain search problems with counteraction. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete search programs on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3671788 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4731204 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On some problems of guaranteed search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some problems of the search on graphs with retaliation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5749172 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5202865 / 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
Property / cites work
 
Property / cites work: Some results about pursuit games on metric spaces obtained through graph theory techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Searching in a Crime Wave / 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: Q2752024 / 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: Call routing and the ratcatcher / 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: Minimal trees of given search number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Algorithms for a Pursuit-Evasion Problem in Grids / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Searchlight Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: SEARCHING A POLYGONAL REGION FROM THE BOUNDARY / rank
 
Normal rank
Property / cites work
 
Property / cites work: Searching for a Mobile Intruder in a Polygonal Region / rank
 
Normal rank
Property / cites work
 
Property / cites work: SEARCHING A PSEUDO 3-SIDED SOLID ORTHOCONVEX GRID / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixed searching and proper-path-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sweeping simple polygons with the minimum number of chain guards / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and obstructions for linear-width and related search parameters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3798505 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded Tree-Width and LOGCFL / rank
 
Normal rank
Property / cites work
 
Property / cites work: Searching a polygonal region by a group of stationary \(k\)-searchers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Searching for mobile intruders in a polygonal region by a group of mobile searchers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong-mixed searching and pathwidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Directed Searching Digraphs: Monotonicity and Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Digraph Strong Searching: Monotonicity and Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Searching Cycle-Disjoint Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4488859 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Search problems in graphs with retaliation / rank
 
Normal rank

Latest revision as of 11:30, 28 June 2024

scientific article
Language Label Description Also known as
English
An annotated bibliography on guaranteed graph searching
scientific article

    Statements

    An annotated bibliography on guaranteed graph searching (English)
    0 references
    0 references
    0 references
    24 June 2008
    0 references
    graph searching
    0 references
    cops and robbers games
    0 references
    fugitive search games
    0 references
    pursuit evasion in graphs
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers