NOC:Advanced Graph Theory - Study24x7
Social learning Network
NOC:Advanced Graph Theory
broucher Course Brochure
NOC:Advanced Graph Theory
by Dr Rajiv Misra

In mathematics, graph theory is the study of graphs, which are mathematical structures used to model pairwise relations between objects. A graph in this context is made up of vertices (also called nodes or points) which are connected by edges (also called links or lines). A distinction is made between undirected graphs, where edges link two vertice...

0.0  (0 Ratings) 1 Learner
validy img Validity Unlimited
level All Level
level English
cover Img Preview not available
Program Fee
FREE
About This Course

In mathematics, graph theory is the study of graphs, which are mathematical structures used to model pairwise relations between objects. A graph in this context is made up of vertices (also called nodes or points) which are connected by edges (also called links or lines). A distinction is made between undirected graphs, where edges link two vertice...

Show more
Course Curriculum
8 Sections | 22 Lecture | 17h 49min total length
Expand all sections
NOC:Advanced Graph Theory

Week 01

| 01h 53min total length
  • <?php echo $alt; ?>

    Paths, Cycles, and Trails

    37m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    Eulerian Circuits, Vertex Degrees and Counting

    37m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    Graph Theory: Introduction

    37m <?php echo $alt; ?>
NOC:Advanced Graph Theory

Week 02

| 02h 20min total length
  • <?php echo $alt; ?>

    Spanning Trees and Enumeration

    46m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    Trees and Distance

    46m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    The Chinese Postman Problem and Graphic Sequences

    46m <?php echo $alt; ?>
NOC:Advanced Graph Theory

Week 03

| 02h 58min total length
  • <?php echo $alt; ?>

    Matchings and Covers

    1h 72 min <?php echo $alt; ?>
  • <?php echo $alt; ?>

    Independent Sets, Covers and Maximum Bipartite Matching

    1h 72 min <?php echo $alt; ?>
  • <?php echo $alt; ?>

    Weighted Bipartite Matching

    32m <?php echo $alt; ?>
NOC:Advanced Graph Theory

Week 04

| 52min 00sec total length
  • <?php echo $alt; ?>

    Factors & Perfect Matching in General Graphs

    26m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    Stable Matchings and Faster Bipartite Matching

    26m <?php echo $alt; ?>
NOC:Advanced Graph Theory

Week 05

| 03h 04min total length
  • <?php echo $alt; ?>

    Connectivity and Paths: Cuts and Connectivity

    1h 61 min <?php echo $alt; ?>
  • <?php echo $alt; ?>

    k-Connected Graphs

    1h 61 min <?php echo $alt; ?>
  • <?php echo $alt; ?>

    Network Flow Problems

    1h 61 min <?php echo $alt; ?>
NOC:Advanced Graph Theory

Week 06

| 02h 12min total length
  • <?php echo $alt; ?>

    Vertex Coloring and Upper Bounds

    44m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    Brook Theorem and Color-Critical Graphs

    44m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    Counting Proper Colorings

    44m <?php echo $alt; ?>
NOC:Advanced Graph Theory

Week 07

| 56min 56sec total length
  • <?php echo $alt; ?>

    Planar Graphs

    28m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    Characterization of Planar Graphs

    28m <?php echo $alt; ?>
NOC:Advanced Graph Theory

Week 08

| 03h 30min total length
  • <?php echo $alt; ?>

    Line Graphs and Edge-coloring

    1h 80 min <?php echo $alt; ?>
  • <?php echo $alt; ?>

    Hamiltonian Graph, Traveling Salesman Problem and NP-Completeness

    1h 80 min <?php echo $alt; ?>
  • <?php echo $alt; ?>

    Connected Dominating Set and Distributed Algorithm

    50m <?php echo $alt; ?>
show 5 more sections
More Courses by Dr Rajiv Misra

NOC:Cloud Computing and Distributed Systems

by Dr Rajiv Misra
0.0 (0)

2 Enrollments

Validity Unlimited

Free

NOC:Big Data Computing

by Dr Rajiv Misra
0.0 (0)

0 Enrollments

Validity Unlimited

Free

NOC:Distributed Systems

by Dr Rajiv Misra
0.0 (0)

1 Enrollments

Validity Unlimited

Free