140 likes | 326 Views
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
E N D
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
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; .
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.
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.
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
Marks Distribution • Attendance 10 • Presentation 15 • Review Paper Writing 15 • Compilation of two class lectures in Latex 10 • Examination 50
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.
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
Presentation Schedule • Presentation time: 20 minutes • Presentation will start from 5th week.
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)
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.