All posts Request account Log in

Loading …

nina nani nani nina

A&W

ViewList 📁 Folders

TypeAll6 ? Questions4 ! Remarks1 ↗ Resources1

SubtopicAll6 flow2 MIN-CUT2 probabilistic algorithms2 probability1

▸ More filters▾ Fewer filters

Foldersby Subtopic by Person by Type by Status

SortNewest Unanswered first Most relevant

StatusAll6 Open3

📁Open3

?Which max-flow algorithm should we focus on for the exam?open
killerbunny · 1 h ago
flow MIN-CUT
▲ 2same question · 11 answer

MaterialAll6 Slides / lectures0 Script0 Homework0 Exams0 Labs0 Other0

TopicA&W Analysis 1 Lineare Algebra Parallel Programming other

Person

Time

lastdays

?

Why does Karger's MIN-CUT algorithm succeed with probability ≥ 2/(n(n−1))?

open

tester · 5 h ago

probabilistic algorithms MIN-CUT

▲ 0same question · 01 answer

?aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaopen

tester · 3 h ago

▲ 0same question · 00 answers

📁Closed1

?images✓ closed
tester · 15 h ago
▲ 0same question · 01 answer

📁No status2

↗Cheat-sheet: tail bounds (Markov, Chebyshev, Chernoff) with when to use each
tester · 5 h ago
probability probabilistic algorithms
▲ 0
!Lecture 9 slide 14: max-flow value stated with a wrong constant
tester · 5 h ago
flow
▲ 1✓ 1 · ✗ 00 answers