Question

Proving the Bijectiveness of a Discrete Binomial Function (multivariable)

score 44 · Answer 1 · 2021-07-13 21:20:25

44

Views

Proving the Bijectiveness of a Discrete Binomial Function (multivariable)

Published on 13 Jul 2021 - 21:20

score 241 · Answer 2 · 2021-07-17 16:39:41

241

Views

How to show these three equivalent statements? (Graph Theory)

Published on 17 Jul 2021 - 16:39

score 996 · Answer 3 · 2021-07-19 17:35:08

996

Views

Recursive formula for a tree problem

Published on 19 Jul 2021 - 17:35

score 103 · Answer 4 · 2021-07-23 17:27:57

103

Views

There exists a MST $T$ of $G$ with $w$ so $T\subseteq T_{1}\cup T_{2}$.

Published on 23 Jul 2021 - 17:27

score 31 · Answer 5 · 2026-03-30 18:43:43

31

Views

For every $v\in V$, the MST of $G$, contains an edge, touching $v$, that has the minimal weight from all the edges touching $v$

Published on 30 Mar 2026 - 18:43

score 52 · Answer 6 · 2026-03-29 19:09:20

52

Views

Prune length distribution of random binary tree

Published on 29 Mar 2026 - 19:09

score 2k · Answer 7 · 2021-08-09 20:48:32

2k

Views

Use depth-first search to produce a spanning tree for the given simple graph

Published on 09 Aug 2021 - 20:48

score 207 · Answer 8 · 2021-08-11 21:20:19

207

Views

Prove that $k$ successive calls to binary tree successor take $O(k + h) $ time

Published on 11 Aug 2021 - 21:20

score 107 · Answer 9 · 2026-03-28 07:48:18

107

Views

I can't find the dp formula for counting the number of connected components that contains all value from $1$ to $k$.

Published on 28 Mar 2026 - 7:48

score 129 · Answer 10 · 2021-08-17 15:38:39

129

Views

Number of Planted Plane Trees, Every Node Multiple of m

Published on 17 Aug 2021 - 15:38

score 262 · Answer 11 · 2021-08-19 06:20:42

262

Views

What is the arboricity of special family of graphs?

Published on 19 Aug 2021 - 6:20

score 488 · Answer 12 · 2021-08-21 13:04:27

488

Views

Number of spanning trees of graph on picture

Published on 21 Aug 2021 - 13:04

score 3.3k · Answer 13 · 2026-03-26 06:21:33

3.3k

Views

Prove by induction that the height of a complete binary tree with n nodes is $⌈\log_2(n+1)⌉ - 1 $

Published on 26 Mar 2026 - 6:21

score 37 · Answer 14 · 2026-03-27 15:07:36

37

Views

Formulation of cost minimization problem of graph

Published on 27 Mar 2026 - 15:07

score 282 · Answer 15 · 2021-09-03 17:49:30

282

Views

What is an example of an infinite tree with depth 3?

Published on 03 Sep 2021 - 17:49

List Question

Proving the Bijectiveness of a Discrete Binomial Function (multivariable)

How to show these three equivalent statements? (Graph Theory)

Recursive formula for a tree problem

There exists a MST $T$ of $G$ with $w$ so $T\subseteq T_{1}\cup T_{2}$.

For every $v\in V$, the MST of $G$, contains an edge, touching $v$, that has the minimal weight from all the edges touching $v$

Prune length distribution of random binary tree

Use depth-first search to produce a spanning tree for the given simple graph

Prove that $k$ successive calls to binary tree successor take $O(k + h) $ time

I can't find the dp formula for counting the number of connected components that contains all value from $1$ to $k$.

Number of Planted Plane Trees, Every Node Multiple of m

What is the arboricity of special family of graphs?

Number of spanning trees of graph on picture

Prove by induction that the height of a complete binary tree with n nodes is $⌈\log_2(n+1)⌉ - 1 $

Formulation of cost minimization problem of graph

What is an example of an infinite tree with depth 3?

Trending Questions

Popular # Hahtags

Popular Questions