User Inuyasha Yagami

27 votes

Accepted

Is there a known polynomial time complexity problem with bad constants?

answered Nov 9 at 21:16

9 votes

False proofs that look correct

answered Jun 8 at 11:01

9 votes

False proofs that look correct

answered Jun 8 at 11:25

8 votes

False proofs that look correct

answered Jun 8 at 16:52

6 votes

Why is my implementation of Dijkstra's Algorithm using min heap faster than using an unsorted array for a complete graph?

answered Sep 19, 2021 at 16:30

5 votes

How does Dijkstra's problem 1 (tree of minimal total length) work and what does it do?

answered Jun 21, 2021 at 15:02

5 votes

Accepted

Let the vertices of the graph G be the numbers 1, 2, ..., 100, a. Determine χ(G), the chromatic number of the graph G

answered Jun 9 at 16:41

4 votes

Accepted

What is a guarenteed amount of colors, depending on the graph's arboricity

answered Jun 10, 2021 at 7:17

4 votes

0/1 knapsack problem: Greedy Algorithm Counterexample

answered Jun 12, 2021 at 18:08

4 votes

Minimum number of groups such that every element in graph is included?

answered Jun 17, 2021 at 4:52

4 votes

Accepted

Minimum set cover with incompatible sets

answered Mar 1, 2021 at 18:09

4 votes

Accepted

What is the difference between Euler and Eulerian graph?

answered Sep 24, 2021 at 6:48

4 votes

Solve $T (n) = T (\frac n2) + n(2 - \cos n)$

answered Sep 25, 2021 at 19:51

4 votes

Accepted

Parition a multiset of numbers into two subsets, how to maximize the sum of their medians?

answered Jan 19, 2022 at 15:52

4 votes

What is the time complexity of this algorithm of finding all prime numbers?

answered Sep 29 at 20:01

4 votes

Accepted

Number of "one neighbourhood" search trees in a graph

answered Jul 17 at 14:48

3 votes

Convex Polygon Triangulation: Line Intersects at most $O(\log n)$ Triangles

answered Feb 3, 2022 at 21:10

3 votes

A function which is both $o(\log^* n)$ and $\omega(1)$

answered Apr 14, 2022 at 11:58

3 votes

Accepted

Maximum independent subset for graphs with lots of edges

answered Jan 15, 2022 at 18:04

3 votes

Find a minimum-cardinality Hall-violator

answered Dec 17, 2021 at 9:24

3 votes

Accepted

Complexity of a variant of Subset Sum problem

answered Sep 25, 2021 at 5:11

3 votes

Minimum time to finish all meetings

answered Sep 22, 2021 at 17:16

3 votes

Can you use Dijkstra's algorithm to find the maximum cost path?

answered Aug 26, 2021 at 12:03

3 votes

What is the optimal solution for the following "Largest lexicographical string with <= K consecutive elements" problem? Why is my answer wrong?

answered Jun 20, 2021 at 14:09

3 votes

Accepted

Check array in linear time with a constant space complexity

answered May 11, 2021 at 15:49

3 votes

Accepted

Each cycle in the graph, the edge with the minimum weight belongs to MST

answered Feb 3, 2021 at 7:41

3 votes

Accepted

Graph with $\Theta(2^n)$ minimum $(s, t)$-cuts

answered May 17, 2021 at 17:46

3 votes

Approximation of Set Cover

answered Jan 8, 2021 at 6:08

3 votes

Isn't linear time O(n)?

answered Jan 9, 2021 at 15:50

3 votes

Accepted

Time complexity of comparing $N$ strings

answered Jan 12, 2021 at 17:12

Stack Exchange Network

209 Answers

Is there a known polynomial time complexity problem with bad constants?

False proofs that look correct

False proofs that look correct

False proofs that look correct

Why is my implementation of Dijkstra's Algorithm using min heap faster than using an unsorted array for a complete graph?

How does Dijkstra's problem 1 (tree of minimal total length) work and what does it do?

Let the vertices of the graph G be the numbers 1, 2, ..., 100, a. Determine χ(G), the chromatic number of the graph G

What is a guarenteed amount of colors, depending on the graph's arboricity

0/1 knapsack problem: Greedy Algorithm Counterexample

Minimum number of groups such that every element in graph is included?

Minimum set cover with incompatible sets

What is the difference between Euler and Eulerian graph?

Solve $T (n) = T (\frac n2) + n(2 - \cos n)$

Parition a multiset of numbers into two subsets, how to maximize the sum of their medians?

What is the time complexity of this algorithm of finding all prime numbers?

Number of "one neighbourhood" search trees in a graph

Convex Polygon Triangulation: Line Intersects at most $O(\log n)$ Triangles

A function which is both $o(\log^* n)$ and $\omega(1)$

Maximum independent subset for graphs with lots of edges

Find a minimum-cardinality Hall-violator

Complexity of a variant of Subset Sum problem

Minimum time to finish all meetings

Can you use Dijkstra's algorithm to find the maximum cost path?

What is the optimal solution for the following "Largest lexicographical string with <= K consecutive elements" problem? Why is my answer wrong?

Check array in linear time with a constant space complexity

Each cycle in the graph, the edge with the minimum weight belongs to MST

Graph with $\Theta(2^n)$ minimum $(s, t)$-cuts

Approximation of Set Cover

Isn't linear time O(n)?

Time complexity of comparing $N$ strings