Computer Science Stack Exchange is a question and answer site for students, researchers and practitioners of computer science. It only takes a minute to sign up.

Sign up to join this community

Anybody can ask a question

Anybody can answer

The best answers are voted up and rise to the top

Explore our Questions

Ask Question

more tags

Active 1 Bountied Hot Week Month

0

votes

0

answers

6

views

Residual network node at not active status

algorithms network-flow minimum-cuts max-cut

modified 38 mins ago JCybersec 1

0

votes

0

answers

6

views

Counting all subsequences constrained to a condition

algorithms counting

asked 53 mins ago Avra 449

3

votes

0

answers

38

views

Fast and compact data structure for dynamic graphs

algorithms graphs data-structures online-algorithms streaming-algorithm

modified 1 hour ago Matthieu Latapy 376

0

votes

1

answer

32

views

speed of preorder traversal

time-complexity graph-traversal

modified 1 hour ago CommunityBot 1

0

votes

1

answer

36

views

Streaming interval cover algorithm

algorithms streaming-algorithm

modified 2 hours ago D.W.♦ 136k

0

votes

1

answer

28

views

Is log^2 (n) ∈ O(n) true?

algorithms time-complexity

answered 4 hours ago stam_a 41

0

votes

1

answer

19

views

What Graph Algorithm can determine ideal distribution of items to travel the least amount of distance from any node?

algorithms graphs minmax-algorithm

modified 4 hours ago lox 1,599

8

votes

2

answers

2k

views

Time Complexity analysis for Map-Reduce model

algorithms algorithm-analysis runtime-analysis parallel-computing

modified 4 hours ago CommunityBot 1

0

votes

0

answers

6

views

Minimum spanning tree containing specific edges

algorithms graphs minimum-spanning-tree

asked 4 hours ago Abs 1

8

votes

4

answers

570

views

Real life examples of negative weight edges in graphs

algorithms graphs discrete-mathematics weighted-graphs

answered 5 hours ago Hovercouch 101

8

votes

0

answers

269

views

From coin flips to algebraic functions via pushdown automata

pushdown-automata probabilistic-algorithms simulation

modified 6 hours ago Peter O. 161

0

votes

1

answer

81

views

Prove: If $T'$ is not a MST one of its edges may be replaced by a lighter edge in order to get a lighter spanning tree

minimum-spanning-tree

modified 6 hours ago CommunityBot 1

2

votes

1

answer

58

views

Ask for help to prove a inequality, thanks

algorithms complexity-theory time-complexity algorithm-analysis space-complexity

answered 6 hours ago Yuval Filmus 261k

0

votes

0

answers

17

views

Basic properties of linear codes

error-correcting-codes

modified 7 hours ago Yuval Filmus 261k

Browse more Questions

Computer Science Stack Exchange works best with JavaScript enabled