SEARCHING A POLYGONAL REGION FROM THE BOUNDARY (Q4682159): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / 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: Mountain Climbing, Ladder Moving, and the Ring-Width of a Polygon / rank
 
Normal rank
Property / cites work
 
Property / cites work: AN OPTIMAL ALGORITHM FOR THE TWO-GUARD PROBLEM / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE TWO GUARDS PROBLEM / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Algorithm for Finding the Kernel of a Polygon / 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: The Searchlight Scheduling Problem / 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: Bushiness and a tight worst-case upper bound on the search number of a simple polygon. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Guard Walkability of Simple Polygons / rank
 
Normal rank

Latest revision as of 11:17, 10 June 2024

scientific article; zbMATH DE number 2174810
Language Label Description Also known as
English
SEARCHING A POLYGONAL REGION FROM THE BOUNDARY
scientific article; zbMATH DE number 2174810

    Statements

    Identifiers