ViewTube

ViewTube
Sign inSign upSubscriptions
Filters

Upload date

Type

Duration

Sort by

Features

Reset

159 results

Parviz Khairullaev
Efficient Planarity Testing (The Hopcroft-Tarjan Algorithm (Linear Time)
6:28
Efficient Planarity Testing (The Hopcroft-Tarjan Algorithm (Linear Time)

81 views

8 months ago

Code & Canvas
Tarjan’s Algorithm Explained | Strongly Connected Components (SCCs) in Graphs

In this video, we'll dive deep into Tarjan's Algorithm – one of the most efficient ways to find Strongly Connected Components ...

26:28
Tarjan’s Algorithm Explained | Strongly Connected Components (SCCs) in Graphs

509 views

1 year ago

Shradha Khapra
Bridge in Graph using Tarjan's Algorithm | Critical Connections

This lecture was made with a lot of love❤️ ✨New DSA Sheet Link : https://dsa.apnacollege.in Share your progress on Twitter ...

32:36
Bridge in Graph using Tarjan's Algorithm | Critical Connections

10,824 views

3 months ago

Pulkit Malhotra
Tarjan's Algorithm | Strongly Connected Component | Graph Theory | Level 2 | Connectivity in Graph

Problem: https://www.geeksforgeeks.org/problems/strongly-connected-component-tarjanss-algo-1587115621/1 Code: ...

16:17
Tarjan's Algorithm | Strongly Connected Component | Graph Theory | Level 2 | Connectivity in Graph

166 views

8 months ago

University of Tartu Institute of Computer Science
Robert Tarjan “Fast and Simple Sorting Using Partial Information”

On 25 April, Turing Award Laureate Robert Tarjan gave a public lecture at the UT Institute of Computer Science titled “Fast and ...

59:33
Robert Tarjan “Fast and Simple Sorting Using Partial Information”

158 views

3 months ago

Shradha Khapra
Articulation Point in Graph using Tarjan's Algorithm | Critical Points

This lecture was made with a lot of love❤️ ✨New DSA Sheet Link : https://dsa.apnacollege.in Share your progress on Twitter ...

36:53
Articulation Point in Graph using Tarjan's Algorithm | Critical Points

11,539 views

3 months ago

Yash Poonia
Tarjan's Algorithm Explained: Strongly Connected Components (SCC)

Tarjan’s Algorithm is one of the most elegant and efficient ways to find Strongly Connected Components (SCCs) in a directed ...

44:08
Tarjan's Algorithm Explained: Strongly Connected Components (SCC)

388 views

1 month ago

CGTN
Turing Awardee Robert Tarjan: Why AI needs human curiosity beyond algorithms

Algorithms power the very core of top applications today, driving search engines, social media and AI large language models.

28:10
Turing Awardee Robert Tarjan: Why AI needs human curiosity beyond algorithms

703 views

7 days ago

AI Guy | Average IT Guy
Tarjan Algorithm | SCC Using Low-Link Logic (EP-30)

🔥 Episode 30 – Tarjan Algorithm for Strongly Connected Components In this video, we implement one of the most important ...

26:56
Tarjan Algorithm | SCC Using Low-Link Logic (EP-30)

18 views

4 months ago

喬峰
🎙️ Why Donald Knuth loves Tarjan's algorithm

... when we talk about algorithms there is this expectation of a top- down command but Tarjan shows us that if you design the room ...

20:44
🎙️ Why Donald Knuth loves Tarjan's algorithm

26 views

4 months ago

The Code Bit
Push Relabel Algorithm Explained

The Push–Relabel algorithm, also known as the Goldberg–Tarjan algorithm, is one of the most important and efficient methods for ...

6:16
Push Relabel Algorithm Explained

1,230 views

7 months ago

InfoToNote
Demystifying Graphs

Strongly Connected Components (SCC): ◦ Tarjan's Algorithm: Finding SCCs in a single DFS pass using discovery and low-link ...

8:12
Demystifying Graphs

26 views

6 months ago

Web Fusion with Bharadwaj
59. Tarjan's Algorithm in Python

Welcome to Code-with-Bharadwaj! Hi there! I'm Manu, and I'm excited to help you level up your coding skills.

23:18
59. Tarjan's Algorithm in Python

65 views

10 months ago

World Laureates Summit
Developing "Taste" in Research: Turing Laureate on Why AI Must Learn to Ask the Right Questions

"Asking the right question is far more important than finding the answer." In an inspiring address directed at the next generation of ...

6:25
Developing "Taste" in Research: Turing Laureate on Why AI Must Learn to Ask the Right Questions

34 views

2 months ago

CodeLucky
Articulation Points in Graphs: Finding Cut Vertices Algorithm Explained

Mastering Tarjan's Algorithm logic for finding cut vertices will level up your graph theory skills! #GraphTheory #Algorithms ...

3:22
Articulation Points in Graphs: Finding Cut Vertices Algorithm Explained

219 views

7 months ago

metachess
DAY 6 | TARJAN'S ALGORITHM | JOURNEY FROM 1200 TO 1400

Tarjan's algorithm finds all Strongly Connected Components (SCCs) in a directed graph in O(V + E) time using a single DFS ...

10:09
DAY 6 | TARJAN'S ALGORITHM | JOURNEY FROM 1200 TO 1400

7 views

Streamed 5 months ago

Raghav Malik
ECE 36800: Kruskal's Algorithm, Tarjan's Algorithm, Union-Find
56:40
ECE 36800: Kruskal's Algorithm, Tarjan's Algorithm, Union-Find

9 views

9 months ago

Web Fusion with Bharadwaj
102. Tarjan’s SCC Algorithm (Java)

Welcome to Code-with-Bharadwaj! Hi there! I'm Manu, and I'm excited to help you level up your coding skills.

21:21
102. Tarjan’s SCC Algorithm (Java)

136 views

6 months ago

TechStack in Motion
Strongly Connected Components (Kosaraju + Tarjan)
11:06
Strongly Connected Components (Kosaraju + Tarjan)

4 views

4 months ago

Dr R Yeap
Four path finding algorithms: DFS, BFS, A* and Greedy Best-First Search

Inspiration from https ://www.linkedin.com/posts/technology-education-artificialintelligence-ugcPost-7472788817255571456-GV6j ...

1:55
Four path finding algorithms: DFS, BFS, A* and Greedy Best-First Search

2 views

2 months ago