Bibliographic Details
| Title: |
Parameterized Complexity of Geometric Problems. |
| Authors: |
Panos Giannopoulos, Christian Knauer, Sue Whitesides |
| Source: |
Computer Journal. 2008, Vol. 51 Issue 3, p372-372. 1p. |
| Subjects: |
Algorithms, Computers in geometry, Geometric modeling, Graph theory, Combinatorics, Graph labelings, Graphic methods |
| Abstract: |
This paper surveys parameterized complexity results for hard geometric algorithmic problems. It includes fixed-parameter tractable problems in graph drawing, geometric graphs, geometric covering and several other areas, together with an overview of the algorithmic techniques used. Fixed-parameter intractability results are surveyed as well. Finally, we give some directions for future research. [ABSTRACT FROM AUTHOR] |
|
Copyright of Computer Journal is the property of Oxford University Press / USA and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Engineering Source |
