27.01.2015 Views

Computational Geometry - Spring 2011

Computational Geometry - Spring 2011

Computational Geometry - Spring 2011

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

<strong>Computational</strong> <strong>Geometry</strong> – Fall 2013<br />

Intersection Graphs of Geometric Objects: Topics for MS students<br />

All presentations need to be submitted to dragan@cs.kent.edu on November 26 th , 2013.<br />

1. Alsulaiman, Anwar Z<br />

Vontikommu, Sravya Reddy<br />

Mukka Pullammagari, Dinesh Kumar Reddy -- Interval graphs<br />

2. Bangalore Revanna, Rajhesh B.<br />

Bhasin, Lokesh<br />

Pasunuri, Venkatesh Reddy -- Permutation graphs<br />

3. Biesan, Shawn N.<br />

Boddu, Usha Rani<br />

Pasumarthy, Venkata Anil Kumar -- Trapezoid graphs<br />

4. Bottu, Shiva Vamshi Raj<br />

Boyapally, Hariprasad Reddy<br />

Trivedi, Kedarnath A. -- Co-comparability graphs as the intersection graphs of polylines between two lines<br />

5. Boyina, Sindhu<br />

Budha, Prudhvi Yaswanth Teja Y.<br />

Vishwanatham, Jaideep -- Chordal graphs as the intersection graphs of subtrees of a tree<br />

6. Bula, Joel S.<br />

Chithirala, Venkata Sandeep Kumar<br />

Pitla, Kamal Kumar -- Circular-arc graphs<br />

7. Dommaraju, Sowmya<br />

Enukonda, Vikram Reddy<br />

Kocherla, Uday Avinash -- Circle graphs<br />

8. Ganga, Nagarjuna<br />

Goli, Sai Shiva Teja<br />

Kotta, Goutami -- Polygonal graphs<br />

9. Jangili, Venkateshwarlu<br />

Karnati, Madhumitha<br />

Machavaram, Venkata Saikrishna -- Boxicity k graphs<br />

10. Mahareddy, Harik Kumar<br />

Mallesh, Supraja Reddy<br />

Madam, Ravikumar -- String graphs<br />

11. Mao, Jing<br />

Zhang, Zhe -- Line graphs<br />

12. Angelis, Daniel S.<br />

Pogrebinsky, Rostislav<br />

Haiber, Charles K. – Unit Disk graphs and Disk graphs


To cover in your presentation:<br />

1. definitions, examples,<br />

2. what real-life problems can be modeled by these graphs,<br />

3. how to recognize if a giving graph belongs to the family,<br />

4. how, giving such a graph, to construct an intersection model,<br />

5. important properties and/or characterizations,<br />

6. what graph problems can be solved efficiently on these graphs and why.<br />

To start your search:<br />

1. http://en.wikipedia.org/wiki/Intersection_graph<br />

2. Martin Charles Golumbic, Algorithmic Graph Theory and Perfect Graphs, First edition, Academic Press,<br />

New York, 1980, Second edition, Annals of Discrete Mathematics 57, Elsevier, 2004.<br />

3. Graph Classes: A Survey is published by SIAM, the Society for Industrial and Applied Mathematics,<br />

Philadelphia, as a volume of the SIAM Monographs on Discrete Mathematics and Applications. ISBN: 0-<br />

89871-432-X (see also<br />

http://www.informatik.uni-rostock.de/~ab/survey/survey.html )<br />

4. E. Prisner A Journey through Intersection Graph County<br />

5. Jan Kratochvíl, A video lecture on intersection graphs (June 2007)<br />

6. McKee, Terry A.; McMorris, F. R. (1999), Topics in Intersection Graph Theory, SIAM Monographs on<br />

Discrete Mathematics and Applications, 2, Philadelphia: Society for Industrial and Applied Mathematics,<br />

ISBN 0-89871-430-3

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!