User Sudix

7 votes

1 answer

124 views

Given a constant k, find the biggest possible rooted tree, if for every path from root to leaf, the sum of the arity of its nodes equals k?

asked Jan 27, 2019 at 8:01

5 votes

1 answer

1k views

Approximating the biggest acyclic subgraph of a given weighted digraph $G= (V,E)$

asked Feb 3, 2019 at 19:09

5 votes

2 answers

223 views

Finding the cheapest buy order with fixed inflation for each product

asked Feb 18, 2019 at 17:36

4 votes

1 answer

102 views

Calculating all products of $n-1$ factors when given $n$ factors

asked May 11, 2019 at 2:27

4 votes

1 answer

122 views

Maximum number of cliques of size $\ge 2$ of a graph with exactly $m$ edges

asked Aug 19, 2021 at 12:02

3 votes

1 answer

122 views

Applications of the splittance of a graph/ Turning graphs into splitgraphs

asked May 17, 2021 at 16:49

3 votes

1 answer

433 views

CSMA/CD with binary exponential backoff: Do both back off or just the loser?

asked Jun 18, 2018 at 1:02

2 votes

1 answer

447 views

Efficient alternatives to inclusion-exclusion

asked Apr 7, 2018 at 16:12

2 votes

0 answers

42 views

When does knowing the number of solutions help (improve the running time)?

asked Jul 30, 2019 at 2:55

2 votes

1 answer

340 views

Is a simple graph connected, if every node has at least one adjacent edge and $|E|\ge |V|-1$?

asked Jul 30, 2019 at 21:22

2 votes

1 answer

27 views

Is two-coloring parts of a bipartite graph so that for each uncolored vertex, the incoming edges from each color are roughly equal NP-complete?

asked Apr 2, 2020 at 16:37

1 vote

1 answer

38 views

Is it NP-hard to check whether for a $k$ there exist both a Cut and a Bisection of value $k$?

asked Jun 30, 2021 at 18:19

1 vote

2 answers

1k views

Solving the Knapsack problem in $O(v^n^2)$, where $v^$ is the maximum value of all $n$ items

asked Nov 29, 2018 at 19:10

1 vote

2 answers

2k views

What's the time complexity bound for the Knapsack with real weights?

asked Dec 7, 2018 at 21:50

1 vote

1 answer

52 views

Hoare-Logic: Requirements for imperfect data types

asked Apr 23, 2018 at 3:08

1 vote

0 answers

541 views

Graph data structures - Why is topological sorting so efficient?

asked Jun 13, 2018 at 10:50

1 vote

1 answer

317 views

Minimal paths as solution of a linear program of a special network flow

asked Apr 3, 2019 at 17:38

1 vote

1 answer

109 views

Where's the flaw in my algorithm? (Linear program to solve NP-hard problem)

asked Apr 6, 2019 at 2:34

1 vote

0 answers

207 views

Time complexity: Using linear programming to solve a system of linear equations

asked Apr 11, 2019 at 5:10

1 vote

0 answers

40 views

k-Circle Cover - How to show the faster algorithm isn't slower

asked Jul 6, 2022 at 17:15

0 votes

1 answer

162 views

Bisimulations: Proof that the following LTS are not bisimilar

asked Sep 13, 2018 at 11:15

Stack Exchange Network

21 Questions

Given a constant k, find the biggest possible rooted tree, if for every path from root to leaf, the sum of the arity of its nodes equals k?

Approximating the biggest acyclic subgraph of a given weighted digraph $G= (V,E)$

Finding the cheapest buy order with fixed inflation for each product

Calculating all products of $n-1$ factors when given $n$ factors

Maximum number of cliques of size $\ge 2$ of a graph with exactly $m$ edges

Applications of the splittance of a graph/ Turning graphs into splitgraphs

CSMA/CD with binary exponential backoff: Do both back off or just the loser?

Efficient alternatives to inclusion-exclusion

When does knowing the number of solutions help (improve the running time)?

Is a simple graph connected, if every node has at least one adjacent edge and $|E|\ge |V|-1$?

Is two-coloring parts of a bipartite graph so that for each uncolored vertex, the incoming edges from each color are roughly equal NP-complete?

Is it NP-hard to check whether for a $k$ there exist both a Cut and a Bisection of value $k$?

Solving the Knapsack problem in $O(v^n^2)$, where $v^$ is the maximum value of all $n$ items

What's the time complexity bound for the Knapsack with real weights?

Hoare-Logic: Requirements for imperfect data types

Graph data structures - Why is topological sorting so efficient?

Minimal paths as solution of a linear program of a special network flow

Where's the flaw in my algorithm? (Linear program to solve NP-hard problem)

Time complexity: Using linear programming to solve a system of linear equations

k-Circle Cover - How to show the faster algorithm isn't slower

Bisimulations: Proof that the following LTS are not bisimilar