Question

Greedy Algorithm on Knockout Tournaments: Proof of Correctness

score 184 · Answer 1 · 2026-03-26 22:17:16

184

Views

Greedy Algorithm on Knockout Tournaments: Proof of Correctness

Published on 26 Mar 2026 - 22:17

score 96 · Answer 2 · 2020-01-15 14:59:48

96

Views

Depth-first search on a tree

Published on 15 Jan 2020 - 14:59

score 352 · Answer 3 · 2020-01-18 19:08:03

352

Views

Enumerating rooted forests/trees

Published on 18 Jan 2020 - 19:08

score 104 · Answer 4 · 2020-01-20 03:17:21

104

Views

About the definition of trees for directed graphs in “Introduction to Algorithms 3rd Edition” by CLRS(Cormen, Leiserson, Rivest, Stein)

Published on 20 Jan 2020 - 3:17

score 454 · Answer 5 · 2026-03-25 06:28:37

454

Views

Determinant of the Laplacian matrix of a tree graph

Published on 25 Mar 2026 - 6:28

score 43 · Answer 6 · 2020-01-25 14:32:58

43

Views

Calculate probability of isolated nodes after removing edges

Published on 25 Jan 2020 - 14:32

score 77 · Answer 7 · 2020-01-25 20:01:24

77

Views

How many spanning trees does this graph contains?

Published on 25 Jan 2020 - 20:01

score 375 · Answer 8 · 2020-01-26 18:14:19

375

Views

Counting rooted / unrooted trees / graphs on $n$ vertices

Published on 26 Jan 2020 - 18:14

score 383 · Answer 9 · 2020-01-26 20:52:06

383

Views

Show that there always exists a cut such that an edge of a minimum spanning tree is light

Published on 26 Jan 2020 - 20:52

score 1.5k · Answer 10 · 2020-01-28 04:55:21

1.5k

Views

Normal tree(Graph Theory)

Published on 28 Jan 2020 - 4:55

score 101 · Answer 11 · 2026-03-17 13:07:27

101

Views

Need help understand this theorem of decision trees

Published on 17 Mar 2026 - 13:07

score 103 · Answer 12 · 2020-01-29 19:22:26

103

Views

Node depth in a random binary search tree

Published on 29 Jan 2020 - 19:22

score 149 · Answer 13 · 2020-02-01 11:06:18

Let $T(n,k)$ be the maximum number of vertices with degree $\geq k+1$ for non-root vertices, and $\geq k$ for roots, in a tree with n vertices total.

score 53 · Answer 14 · 2026-03-25 13:51:40

53

Views

Counting number of binary trees with given node values and root

Published on 25 Mar 2026 - 13:51

score 144 · Answer 15 · 2026-03-26 11:00:22

144

Views

Proving Neilsen-Schreier Theorem using "only free groups act freely on a tree"

Published on 26 Mar 2026 - 11:00

List Question

Greedy Algorithm on Knockout Tournaments: Proof of Correctness

Depth-first search on a tree

Enumerating rooted forests/trees

About the definition of trees for directed graphs in “Introduction to Algorithms 3rd Edition” by CLRS(Cormen, Leiserson, Rivest, Stein)

Determinant of the Laplacian matrix of a tree graph

Calculate probability of isolated nodes after removing edges

How many spanning trees does this graph contains?

Counting rooted / unrooted trees / graphs on $n$ vertices

Show that there always exists a cut such that an edge of a minimum spanning tree is light

Normal tree(Graph Theory)

Need help understand this theorem of decision trees

Node depth in a random binary search tree

Let $T(n,k)$ be the maximum number of vertices with degree $\geq k+1$ for non-root vertices, and $\geq k$ for roots, in a tree with n vertices total.

Counting number of binary trees with given node values and root

Proving Neilsen-Schreier Theorem using "only free groups act freely on a tree"

Trending Questions

Popular # Hahtags

Popular Questions