Florida International University
Edit Your Profile
FIU Discovery
Toggle navigation
Browse
Home
People
Organizations
Scholarly & Creative Works
Research Facilities
Support
Edit Your Profile
Optimal algorithms for two-guard walkability of simple polygons
Conference
Bhattacharya, B, Mukhopadhyay, A, Narasimhan, G. (2001). Optimal algorithms for two-guard walkability of simple polygons .
EURO-PAR 2011 PARALLEL PROCESSING, PT 1,
2125 438-449.
Share this citation
Twitter
Email
Bhattacharya, B, Mukhopadhyay, A, Narasimhan, G. (2001). Optimal algorithms for two-guard walkability of simple polygons .
EURO-PAR 2011 PARALLEL PROCESSING, PT 1,
2125 438-449.
Copy Citation
Share
International Collaboration
Overview
Research
Location
Identifiers
Additional Document Info
View All
Overview
cited authors
Bhattacharya, B; Mukhopadhyay, A; Narasimhan, G
authors
Narasimhan, Giri
date/time interval
August 8, 2001 -
publication date
January 1, 2001
published in
DISTRIBUTED COMPUTING (DISC 2014)
Book
Research
keywords
Computer Science
Computer Science, Theory & Methods
HAMILTONIAN TRIANGULATIONS
Mathematics
Mathematics, Applied
Physical Sciences
Science & Technology
Technology
VISIBILITY
Location
Location
RI, PROVIDENCE
Identifiers
International Standard Book Number (ISBN) 10
3-540-42423-7
Additional Document Info
Conference
7th International Workshop on Algorithms and Data Structures (WADS 01)
publisher
SPRINGER-VERLAG BERLIN
start page
438
end page
449
volume
2125