| 001 BFS and DFS.mp4 | 65.8 MB | ||
| 001 BFS and DFS_en.vtt | 15.6 KB | ||
| 001 Edge Connectivity.mp4 | 58.4 MB | ||
| 001 Edge Connectivity_en.vtt | 12.7 KB | ||
| 001 Introduction to Eulerian Graphs.mp4 | 47.3 MB | ||
| 001 Introduction to Eulerian Graphs_en.vtt | 10.4 KB | ||
| 001 Introduction to Planar Graphs.mp4 | 46.7 MB | ||
| 001 Introduction to Planar Graphs_en.vtt | 13.5 KB | ||
| 001 Introduction to Trees.mp4 | 89.8 MB | ||
| 001 Introduction to Trees_en.vtt | 22.2 KB | ||
| 001 Introduction.mp4 | 113.6 MB | ||
| 001 Introduction_en.vtt | 18.8 KB | ||
| 001 Spanning Trees and Adjacency Matrix.mp4 | 56 MB | ||
| 001 Spanning Trees and Adjacency Matrix_en.vtt | 12.6 KB | ||
| 001 Walks in a Graph.mp4 | 73.1 MB | ||
| 001 Walks in a Graph_en.vtt | 15.6 KB | ||
| 002 Centers in Trees.mp4 | 68.6 MB | ||
| 002 Centers in Trees_en.vtt | 17.1 KB | ||
| 002 Connected Graphs.mp4 | 63.2 MB | ||
| 002 Connected Graphs_en.vtt | 15.3 KB | ||
| 002 Dijkstra's Shortest Path Algorithm.mp4 | 24.4 MB | ||
| 002 Dijkstra's Shortest Path Algorithm_en.vtt | 5.3 KB | ||
| 002 Euler Formula and Maximal Planar Graphs.mp4 | 36.2 MB | ||
| 002 Euler Formula and Maximal Planar Graphs_en.vtt | 10.8 KB | ||
| 002 Fleury Algorithm for Eulerian Graphs.mp4 | 55.1 MB | ||
| 002 Fleury Algorithm for Eulerian Graphs_en.vtt | 14.1 KB | ||
| 002 Specific Classes of Graphs.mp4 | 51.8 MB | ||
| 002 Specific Classes of Graphs_en.vtt | 12.6 KB | ||
| 002 The number of Spanning Trees.mp4 | 45.4 MB | ||
| 002 The number of Spanning Trees_en.vtt | 10.7 KB | ||
| 002 Vertex Connectivity and Whitney Theorem.mp4 | 62.6 MB | ||
| 002 Vertex Connectivity and Whitney Theorem_en.vtt | 14.4 KB | ||
| 003 Blocks in a Connected Graph.mp4 | 25.4 MB | ||
| 003 Blocks in a Connected Graph_en.vtt | 5.8 KB | ||
| 003 Graph Isomorphism.mp4 | 63.6 MB | ||
| 003 Graph Isomorphism_en.vtt | 14.5 KB | ||
| 003 Introduction to Hamiltonian Graphs.mp4 | 70.6 MB | ||
| 003 Introduction to Hamiltonian Graphs_en.vtt | 13.6 KB | ||
| 003 Kuratowski Theorem.mp4 | 37.8 MB | ||
| 003 Kuratowski Theorem_en.vtt | 10.6 KB | ||
| 003 Minimum Cost Spanning Trees.mp4 | 97.4 MB | ||
| 003 Minimum Cost Spanning Trees_en.vtt | 19.8 KB | ||
| 003 Problem Sheet.mp4 | 64.8 MB | ||
| 003 Problem Sheet_en.vtt | 14.9 KB | ||
| 003 Regular Graphs and Degree Sequence.mp4 | 104.2 MB | ||
| 003 Regular Graphs and Degree Sequence_en.vtt | 21.1 KB | ||
| 004 Introduction to Network Flow.mp4 | 128.3 MB | ||
| 004 Introduction to Network Flow_en.vtt | 18.3 KB | ||
| 004 Problem Sheet.mp4 | 64.2 MB | ||
| 004 Problem Sheet_en.vtt | 15.6 KB | ||
| 004 Subgraphs and Digraphs.mp4 | 35.3 MB | ||
| 004 Subgraphs and Digraphs_en.vtt | 8 KB | ||
| 004 Sufficient Condition for Hamiltonian Graphs.mp4 | 73.8 MB | ||
| 004 Sufficient Condition for Hamiltonian Graphs_en.vtt | 18 KB | ||
| 005 Ford-Fulkerson Algorithm and Minimum Cut Problem.mp4 | 126.5 MB | ||
| 005 Ford-Fulkerson Algorithm and Minimum Cut Problem_en.vtt | 18.7 KB | ||
| 005 Problem Sheet.mp4 | 82.4 MB | ||
| 005 Problem Sheet_en.vtt | 19.2 KB | ||
| 006 Minimum Cut.mp4 | 64.3 MB | ||
| 006 Minimum Cut_en.vtt | 12.5 KB | ||
| 007 Disjoint Paths.mp4 | 46.7 MB | ||
| 007 Disjoint Paths_en.vtt | 10.6 KB | ||
| 008 Problem Sheet.mp4 | 34.2 MB | ||
| 008 Problem Sheet_en.vtt | 10.7 KB | ||
| 39351872-L2udemy.pdf | 476.2 KB | ||
| 39351918-L3udemy.pdf | 572.2 KB | ||
| 39351976-L4udemy.pdf | 869.1 KB | ||
| 39352098-L5udemy.pdf | 1.1 MB | ||
| 39354022-GTudemyTut-1.pdf | 59.8 KB | ||
| 39354108-L6udemy.pdf | 841.6 KB | ||
| 39354180-L7upload.pdf | 848.2 KB | ||
| 39354682-GraphTheoryTut-2Udemy.pdf | 107 KB | ||
| 39356074-L8upload.pdf | 839.6 KB | ||
| 39356140-L9upload.pdf | 875.2 KB | ||
| 39356276-GraphTheoryTut-3Udemy.pdf | 113.7 KB | ||
| 39356398-L10upload.pdf | 736.7 KB | ||
| 39356454-L11upload.pdf | 614.4 KB | ||
| 39356518-L12upload.pdf | 853.5 KB | ||
| 39475804-L13upload.pdf | 671.9 KB | ||
| 39475860-L14upload.pdf | 852.3 KB | ||
| 39496190-GraphTheoryTut-4Udemy.pdf | 113.9 KB | ||
| 39553224-L15upload.pdf | 784.6 KB | ||
| 39583682-Tut-5Udemy.pdf | 152.6 KB | ||
| 39603122-L16upload.pdf | 635.9 KB | ||
| 39780036-L17.pdf | 1.6 MB | ||
| 39780170-L18.pdf | 923.4 KB | ||
| 39895584-L19.pdf | 617.3 KB | ||
| 39895696-L20.pdf | 365.8 KB | ||
| 40304970-blocks.pdf | 423.8 KB | ||
| 40346988-L23.pdf | 1.7 MB | ||
| 40441732-L24.pdf | 1.9 MB | ||
| 40441778-L25.pdf | 736 KB | ||
| 40523506-GraphTheoryTut-6.pdf | 95.3 KB | ||
| 40709010-L27.pdf | 290.5 KB | ||
| 40716052-L28.pdf | 597.8 KB | ||
| Bonus Resources.txt | 409.6 B | ||
| Get Bonus Downloads Here.url | 204.8 B | ||
| ▲ 101 total files | |||
Graph Theory in Depth
https://CourseMega.com
MP4 | Video: h264, 1280x720 | Audio: AAC, 44.1 KHz
Language: English | Size: 2.15 GB | Duration: 8h 36m
Graph Theory for Undergraduates
What you'll learn
A depth knowledge of graph theory
An exposure to graph algorithms
Analytical thinking
Different approaches for addressing theoretical problems in mathematics
Requirements
No prerequisites
Description
The importance of graph theory can never be exaggerated considering the wide range of its applications, from social sciences to electrical engineering and computer science to management. The rigorous foundation of the subject is thus desirable. The objective of the course is, in addition to logical foundations, theoretical developments and development of the basic skills to tackle problems in Graph theory. It also aimed at understanding how various problems arising from real life or sciences as well as recreational puzzles can be converted to graph theoretic problems like shortest paths, network flows, chromatic numbers, connectivity etc.
This course begins with the basics of Graphs, i.e., it starts with the Simple Graphs and types of Graphs. Then it discusses the Isomorphism in Graphs along with the Euler & Hamiltonian Graphs. After that it talks about Trees and Spanning Trees, Connectivity, Cut Set and Shortest Path, Matrix representation of Graphs, and Maximal Flow in a Network. At the end, it discusses Graph Connectivity, Graph Colouring, Independence number and Chromatic Number.
| torrent name | size | uploader | age | seed | leech |
|---|---|---|---|---|---|
| 2.5 GB | freecoursewb | 2 weeks | 19 | 6 | |
| 3.2 GB | freecoursewb | 2 weeks | 4 | 12 | |
| 1.6 GB | freecoursewb | 5 months | 8 | 3 | |
|
Udemy - Graph Database 2 - Neo4j Cypher Fundamentals - Learn by Hand Posted by
freecoursewb in Other
|
1.9 GB | freecoursewb | 9 months | 0 | 0 |
|
Udemy - Unity Shader Graph - Create Procedural Shaders and Dynamic Fx Posted by
freecoursewb in Other
|
3.1 GB | freecoursewb | 2 years | 0 | 0 |
All Comments