Robust algorithms for restricted domains
- 31 August 2003
- journal article
- Published by Elsevier BV in Journal of Algorithms
- Vol. 48 (1), 160-172
- https://doi.org/10.1016/s0196-6774(03)00048-8
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Unit disk graph recognition is NP-hardComputational Geometry, 1998
- An Õ(n314)-coloring algorithm for 3-colorable graphsInformation Processing Letters, 1997
- Recognizing Greedy StructuresJournal of Algorithms, 1996
- WELL-COVERED GRAPHS: A SURVEYQuaestiones Mathematicae, 1993
- A Note on Well-Covered GraphsPublished by Elsevier BV ,1993
- Unit disk graphsDiscrete Mathematics, 1990
- Searching for empty convex polygonsAlgorithmica, 1990
- On a circle placement problemComputing, 1986
- The complexity of promise problems with applications to public-key cryptographyInformation and Control, 1984
- Some covering concepts in graphsJournal of Combinatorial Theory, 1970