1 / 12

CSE 6410 Advanced Algorithmic Graph Theory

21. 20. t = 16. 18. 19. 17. 15. 12. 14. 13. 14. 16. 12. 11. 13. 10. 9. 15. 11. 8. 6. 10. 7. V. V. V. V. V. V. V. V. 4. 5. 3. 2. 6. 1. 8. 7. 3. 4. 5. 9. 8. 4. 5. 2. 6. 1. 3. u. u. u. 7. 2. 1. n. 2. s = 1. CSE 6410

razi
Download Presentation

CSE 6410 Advanced Algorithmic Graph Theory

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. 21 20 t = 16 18 19 17 15 12 14 13 14 16 12 11 13 10 9 15 11 8 6 10 7 V V V V V V V V 4 5 3 2 6 1 8 7 3 4 5 9 8 4 5 2 6 1 3 u u u 7 2 1 n 2 s = 1 CSE 6410 Advanced Algorithmic Graph Theory

  2. Course Contents • Vertex Orderings: st-Numbering and Canonical Orderings; • Graph Decompositions and Their Algorithmic Applications: Ear Decomposition, Canonical Decomposition, Tree Decomposition, Path Width and Tree Width, PQ-tree, SPQR-tree, Split Decomposition, Recursively Decomposable Graphs, Clique Separator Decomposition; .

  3. Course Contents • Graph Representations: Implicit Representations, Intersection and Containment Representations; • Graph Classes Defined by Forbidden Subgraphs; • Graph Classes Defined by Elimination Schemes; Classes of Graphs with Bounded Treewidth and Their Algorithmic Implications; • Characterization, Construction and Recognition Algorithms for Some Special Classes of Graphs.

  4. Course Contents • Vertex Orderings: st-Numbering and Canonical Orderings; • Graph Decompositions and Their Algorithmic Applications: Ear Decomposition, Canonical Decomposition, Tree Decomposition, Path Width and Tree Width, PQ-tree, SPQR-tree, Split Decomposition, Recursively Decomposable Graphs, Clique Separator Decomposition; • Characterization, Construction and Recognition Algorithms for Some Special Classes of Graphs.

  5. Text Books • T. Nishizeki and M. S. Rahman, Planar Graph Drawing, World Scientific, Singapore, 2004. • J. P. Spinrad, Efficient Graph Representations, American Mathematical Society, 2003. • Results from Journals

  6. Marks Distribution • Attendance 10 • Presentation 15 • Review Paper Writing 15 • Compilation of two class lectures in Latex 10 • Examination 50

  7. Presentation Choose a paper on any topic in the course content published in a reputed journal or conference proceedings. Show me the paper and take my approval. You have to read, understand and present the paper. Use PowerPoint /Beamer for presentation.

  8. Presentation Format • Problem definition • Results of the paper • Contribution of the paper in respect to previous results • Algorithms and methodologies including proofs • Future works, open problems and your idea

  9. Presentation Schedule • Presentation time: 20 minutes • Presentation will start from 5th week.

  10. Paper Writing Choose a topic from the course content. Write a survey paper for getting at most 85% marks of the item. You need to add some new results to get full marks. Use LaTex for writing the paper. Reporting of Topic: July 02, 2012 (5 min presentation) Submission Deadline of preliminary version: August 13, 2012. Final Submission: September 10, 2012 (A hardcopy with all source files in a CD)

  11. Compilation of Class Lectures Each student will compile two of my class lectures using LaTex (I will assign) . You need to add necessary figures for illustration. Xfig is recommended for drawing figures.

  12. Thank You

More Related