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 Hot Week Month

0

votes

0

answers

10

views

Optimization problem over bidirectional connected graph

algorithms graphs data-structures optimization heuristics

asked 1 hour ago dc_Bita98 101

2

votes

1

answer

3k

views

Find shortest path that visits all nodes in a given set of nodes

algorithms graphs

modified 5 hours ago Community♦ 1

1

vote

1

answer

37

views

Local to global algorithms in gossip based P2P networks

algorithms graphs computer-networks peer-to-peer

modified 11 hours ago Yuval Filmus 241k

2

votes

1

answer

62

views

Max flow algorithm for floating-point weights and E~=10*V

graphs network-flow floating-point sparse-matrices

modified 12 hours ago Community♦ 1

4

votes

2

answers

47

views

How to make efficient path minimum queries in a tree?

algorithms graphs trees

modified 23 hours ago Steven 11.7k

-1

votes

0

answers

47

views

Find an minimum weight elementary path with a given constraint

algorithms graphs shortest-path c++

modified yesterday Max N 62

1

vote

0

answers

47

views

Algorithm for creating a map / schematic from a list of travel times?

graphs

modified yesterday Max N 62

0

votes

0

answers

34

views

Most popular path in weighted cylic directed graph

algorithms graphs shortest-path approximation statistics

modified yesterday Max N 62

1

vote

1

answer

457

views

Updating a mst after increasing the weight of an edge in the mst

graphs graph-traversal weighted-graphs minimum-spanning-tree

modified 2 days ago Community♦ 1

1

vote

1

answer

45

views

How to get the shortest simple path in a directed Graph with an additional constraint that it needs to use two arcs in the said path

graphs shortest-path graph-traversal

modified 2 days ago Community♦ 1

7

votes

3

answers

2k

views

Solving the min edge cover using the maximum matching algorithm

algorithms graphs reductions

modified 2 days ago Mengfan Ma 579

0

votes

2

answers

277

views

CLRS Exercise 24.3-4 - Confirm Output of a Program Claiming to Implement Dijkstra's Algorithm

algorithms graphs dijkstras-algorithm

modified 2 days ago Community♦ 1

1

vote

1

answer

30

views

Is it possible to use an adjacency matrix for Bellman-Ford algorithm?

algorithms graphs

modified Jan 17 at 17:05 Jakube 1,276

1

vote

0

answers

19

views

Transforming a multidimensional 0-1 knapsack problem to a maximum weighted clique problem

graphs knapsack-problems

modified Jan 17 at 11:24 Peregring-lk 435

Browse more Questions

Computer Science Stack Exchange works best with JavaScript enabled