Guarding rectangular art galleries (Q1326753): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: The hamiltonian cycle problem is linear-time solvable for 4-connected planar graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5547252 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Lower bounds on the cardinality of the maximum matchings of planar graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3799261 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Theorem on Planar Graphs / rank | |||
Normal rank | |||
Revision as of 15:24, 22 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Guarding rectangular art galleries |
scientific article |
Statements
Guarding rectangular art galleries (English)
0 references
21 August 1994
0 references
guarding
0 references
watchman problem
0 references
computational geometry
0 references
rectangular art gallery
0 references
