Robust algorithms for restricted domains

Journal of Algorithms

Volumn 48, Issue 1, 2003, Pages 160-172

  Raghavan, Vijay ^a   Spinrad, Jeremy ^a  

^a VANDERBILT UNIVERSITY   (United States)

Author keywords

Algorithms; Robustness; Unit disk graphs; Well covered graphs

Indexed keywords

COMPUTATIONAL COMPLEXITY; CRYPTOGRAPHY; GRAPH THEORY; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING; ROBUSTNESS (CONTROL SYSTEMS); SET THEORY;

RESTRICTED DOMAINS;

ALGORITHMS;

EID: 0041928188     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0196-6774(03)00048-8     Document Type: Conference Paper

References (22)

1. J. Abello, H. Lin, S. Pisupati, On visibility graphs of simple polygons, Congr. Numer. 90 (1992) 119-128.
2. 3/14)-coloring algorithm for 3-colorable graphs, Inform. Process. Lett. 61 (1) (1997) 49-53.
3. H. Breu, D. Kirkpatrick, Unit disk graph recognition is NP-hard, Comput. Geom. 9 (1998) 3-24.
4. H. Breu, Algorithmic aspects of constrained unit disk graphs, PhD dissertation, University of British Columbia, 1996.
5. K. Cameron, J. Edmonds, Existentially polytime theorems, polyhedral combinatorics, DIMACS Ser. Discrete Math. Theoret. Comput. Sci. l (1990) 83-100.
6. Y. Caro, A. Sebö, M. Tarsi, Recognizing greedy structures, J. Algorithms 20 (1996) 137-156.
7. B.M. Chazelle, D.T. Lee, On a circle placement problem, Computing 36 (1986) 1-18.
8. V. Chvátal, P.J. Slater, A note on well-covered graphs, Quo vadis, graph theory?, Ann. Discrete Math. 55 (1993) 179-181.
9. B.N. Clark, C.J. Colbourn, D.S. Johnson, Unit disk graphs, Discrete Math. 86 (1990) 165-177.
10. D. Dobkin, H. Edelsbrunner, Searching for empty convex polygons, Algorithmica 5 (1990) 561-571.
11. S. Even, A. Selman, Y. Yacobi, The complexity of promise problems with applications to public-key cryptography, Inform. Control 61 (2) (1984) 159-173.
12. A. Gräf, Coloring and recognizing special graph classes, PhD thesis, Musikwissenschaftliches Institut, Abteilung Musikinformatik, Johannes Gutenberg-Universität Mainz, 1995; Also available as Technical Report Bericht 20.
13. A. Gräf, Coloring and recognizing special graph classes, PhD thesis, Musikwissenschaftliches Institut, Abteilung Musikinformatik, Johannes Gutenberg-Universität Mainz, 1995; Also available as Technical Report Bericht 20.
14. M.D. Plummer, Some covering concepts in graphs, J. Combin. Theory 8 (1970) 91-98.
15. M.D. Plummer, Well-covered graphs: A survey, Quaestiones Math. 16 (1993) 253-287.
16. E. Prisner, Journey through intersection graph country, http://www.math.unihamburg.de/spag/gd/mitarbeiter/prisner/Pris/Rahmen.html3/24/ 99.
17. R.L. Rivest, A. Shamir, L.M. Adleman, A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM 21 (2) (1978) 120-126.
18. A.L. Selman, A taxonomy of complexity classes of functions, J. Comput. Syst. Sci. 48 (2) (1994) 357-381.
19. R. Sankaranarayana, L. Stewart, Complexity results for well covered graphs, Networks 22 (1992) 247-262.
20. J. Spinrad, Efficient Graph Representations, Fields Institute Monographs, American Mathematical Society, 2003.
21. L.G. Valiant, V.V. Vazirani, NP is as easy as detecting unique solutions, Theoret. Comput. Sci. 47 (1986) 85-93.
22. A. Wigderson, Improving the performance guarantee for approximate graph coloring, J. ACM 30 (1984) 729-735.