Two-Guard Walkability of Simple Polygons (Q4513202): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An optimal visibility graph algorithm for triangulated simple polygons / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Minimum Cuts for Circular-Arc Graphs / rank | |||
Normal rank | |||
Latest revision as of 16:17, 30 May 2024
scientific article; zbMATH DE number 1526802
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Two-Guard Walkability of Simple Polygons |
scientific article; zbMATH DE number 1526802 |
Statements
Two-Guard Walkability of Simple Polygons (English)
0 references
7 November 2000
0 references
walk
0 references
