>> Information For:   |   Prospective Students   |   Current Students   |   Alumni   |   Industry & Government   |   Faculty Members
Username : Password : Forgot password?

Advanced Algorithmic Graph Theory

3 Credit Hour Course

Prerequisite:   None

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; 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.

Department of Computer Science and Engineering, ECE building, Palashi, Dhaka, Bangladesh. The Department is part of the Faculty of Electrical and Electronic Engineering at the Bangladesh University of Engineering & Technology. No part or content of this website may be copied or reproduced without permission of the department authority. Contact info@cse.buet.ac.bd with questions or comments on this page.  [Development Credits]