On the domination search number (Q1811076): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Created claim: DBLP publication ID (P1635): journals/dam/FominKM03, #quickstatements; #temporary_batch_1731530891435
 
(2 intermediate revisions by 2 users not shown)
Property / cites work
 
Property / cites work: The bandwidth of a tree with \(k\) leaves is at most \(\lceil \frac k2 \rceil\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient probabilistically checkable proofs and applications to approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4326630 / 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: Q4871748 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / 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: Asteroidal Triple-Free Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Time Algorithms for Dominating Pairs in Asteroidal Triple-free 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: Fugitive-search games on graphs and related parameters / 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: Helicopter search problems, bandwidth and pathwidth / 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: Q4387698 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eavesdropping games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal numberings and isoperimetric problems on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Searching and pebbling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the Bandwidth for Asteroidal Triple-Free Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2741345 / 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: SEARCHING A POLYGONAL ROOM WITH ONE DOOR BY A 1-SEARCHER / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the hardness of approximating minimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topological Bandwidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: On minimizing width in linear layouts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Min Cut is NP-complete for edge weighted trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations and algorithmic applications of chordal graph embeddings / rank
 
Normal rank
Property / cites work
 
Property / cites work: On some problems of guaranteed search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5749172 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4527015 / 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: Optimal Algorithms for a Pursuit-Evasion Problem in Grids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Searching for a Mobile Intruder in a Polygonal Region / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0166-218x(02)00389-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1993495807 / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/dam/FominKM03 / rank
 
Normal rank

Latest revision as of 22:10, 13 November 2024

scientific article
Language Label Description Also known as
English
On the domination search number
scientific article

    Statements

    On the domination search number (English)
    0 references
    0 references
    0 references
    0 references
    10 June 2003
    0 references
    graph searching
    0 references
    domination
    0 references
    asteroidal triple-free graph
    0 references
    dominating target
    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