A counterexample to the algorithms for determining opaque minimal forests (Q1183430): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q124959006, #quickstatements; #temporary_batch_1712286835472 |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: An algorithm for determining an opaque minimal forest of a convex polygon / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An \(O(n^ 3)\) algorithm for finding the minimal opaque forest of a convex polygon / rank | |||
Normal rank | |||
Revision as of 14:47, 15 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A counterexample to the algorithms for determining opaque minimal forests |
scientific article |
Statements
A counterexample to the algorithms for determining opaque minimal forests (English)
0 references
28 June 1992
0 references
An algorithm to find the opaque minimal forest of a convex polygon is given by \textit{V. Akman} [Inf. Process. Lett. 24, 193-198 (1987; Zbl 0653.68030)], and a modification of this algorithm can be found by \textit{P. Dublish} [Inf. Process. Lett. 29, 275-276 (1988; Zbl 0622.68040)]. It is shown by a counter example that both of these algorithms are incorrect.
0 references
opaque minimal forest
0 references
