Vertex-to-point conflict-free chromatic guarding is NP-hard (Q2154089): 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.1007/978-3-030-96731-4_10 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4225706386 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conflict-free chromatic art gallery coverage / rank
 
Normal rank
Property / cites work
 
Property / cites work: On conflict-free chromatic guarding of simple polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial theorem in plane geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inapproximability results for guarding polygons and terrains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4038729 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight bounds for conflict-free chromatic guarding of orthogonal art galleries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational complexity of the chromatic art gallery problem for orthogonal polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: On guarding the vertices of rectilinear domains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational complexity of art gallery problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3799261 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar 3-SAT with a clause/variable cycle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992847 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two NP‐Hard Art‐Gallery Problems for Ortho‐Polygons / rank
 
Normal rank

Latest revision as of 14:17, 29 July 2024

scientific article
Language Label Description Also known as
English
Vertex-to-point conflict-free chromatic guarding is NP-hard
scientific article

    Statements

    Identifiers