Back to Results
First PageMeta Content
Robot control / Visibility graph / Hamiltonian path / Art gallery problem / Graph / Visibility / Clique / Independent set / Line graph / Graph theory / NP-complete problems / Graph operations


Computing the maximum clique in visibility graphs
Add to Reading List

Document Date: 2010-03-10 01:30:36

Open Document

File Size: 222,09 KB

Share Result on Facebook

City

Zurich / /

Company

A. Maheshwari S. P. / Cambridge University Press / /

Country

India / /

Facility

I University of Bonn Bonn / Institute of Computer Science / The Johns Hopkins University / Computer Science Tata Institute of Fundamental Research Mumbai / University of Toronto / /

Organization

Cambridge University / Technology & Computer Science Tata Institute of Fundamental Research Mumbai / The Johns Hopkins University / Subir Kumar Ghosh School of Technology / University of Bonn Bonn / University of Toronto / Institute of Computer Science / Institute for Theoretical Computer Science / /

Person

E. Veni Madhavan / /

Position

guard / /

PublishedMedium

Theoretical Computer Science / Lecture Notes in Computer Science / /

Technology

Visibility Algorithms / /

SocialTag