Show that there exists an algorithm that computes a BFS tree from each node up to depth d in $O(d + \Delta^d)$ rounds.Its allowed to give random algo.

score 146 · Answer 9 · 2022-06-14 14:34:48

Constructive proof of how many trees on $[n]$ have exactly $3$ vertices with degree $3$ and all other vertices with degree $\leq 2$

score 174 · Answer 10 · 2022-06-14 17:33:04

If an edge is part of a cycle, is there always some spanning tree where the cycle is a fundamental cycle and the edge is a chord?

score 112 · Answer 11 · 2022-06-18 23:52:45

112

Views

Should I ceil or floor when finding lower bound of height of binary tree?

Published on 18 Jun 2022 - 23:52

score 51 · Answer 12 · 2022-06-20 19:28:06

51

Views

Connected components of a tree after removing edges of two subtrees

Published on 20 Jun 2022 - 19:28

score 72 · Answer 13 · 2026-03-29 20:52:52

72

Views

Partition a graph into $O(n)$ disjoint cycles and a forest

Published on 29 Mar 2026 - 20:52

score 30 · Answer 14 · 2026-04-03 12:53:15

30

Views

Average path length in tries from the root to the left most leaf

Published on 03 Apr 2026 - 12:53

score 16 · Answer 15 · 2026-03-07 07:12:48

How can I show that $G_{{\cal P}' \div V_s'}[E']$ is a forest such that exists exactly one vertices pair $\{x,y\}$ in $V_s'$ such that are connected?

List Question

Figuring out the Most number of levels in a Binary tree.

Proving weights for MST when there is a ratio between 2 weights functions

A question on a graph which is a a "union" of two trees

Algorithm for Minimum spanning tree

Sum of squares of minimum spanning tree

Path from leaf to root permutation

Let $G$ be optimally coloured with $\chi(G)=k$ colours. Then $T$ be a tree with $k$ vertices. Then $\exists$ a subgraph of $G$ ismorphic with $T$

Show that there exists an algorithm that computes a BFS tree from each node up to depth d in $O(d + \Delta^d)$ rounds.Its allowed to give random algo.

Constructive proof of how many trees on $[n]$ have exactly $3$ vertices with degree $3$ and all other vertices with degree $\leq 2$

If an edge is part of a cycle, is there always some spanning tree where the cycle is a fundamental cycle and the edge is a chord?

Should I ceil or floor when finding lower bound of height of binary tree?

Connected components of a tree after removing edges of two subtrees

Partition a graph into $O(n)$ disjoint cycles and a forest

Average path length in tries from the root to the left most leaf

How can I show that $G_{{\cal P}' \div V_s'}[E']$ is a forest such that exists exactly one vertices pair $\{x,y\}$ in $V_s'$ such that are connected?

Trending Questions

Popular # Hahtags

Popular Questions