Carlos Linares López

289 Bookmarks

2
1
242
views

2
1
551
views

2
1
160
views

2
1
328
views

2
1
64
views

2
0
836
views

Stacking problem, dynamic programming algorithm [closed]

Dec 30 '16 at 10:14 Yuval Filmus 229k
2
1
536
views

2
1
95
views

2
1
234
views

2
0
36
views

How to find more than 1 successive shortest paths between two vertices in unweighted and undirected graph using BFS?

Apr 14 at 14:01 6005 3,014
2
1
28
views

2
1
40
views

2
1
39
views

2
0
45
views

Proving that the Bellman-Ford algorithm contains negative circuit

Jan 5 at 0:09 user114040 21
2
0
218
views

Given undirected and connected graph G=(V,E). Prove for any DFS run: for any u,v∈V if u.d>v.d then u.d−v.d≥δ(u,v)

Dec 4 at 7:51 sasha 21
2
3
469
views

2
1
116
views

2
1
128
views

2
0
20
views

A data structure for efficiently finding nodes relative to other (ex: if a node is earlier in a list than another node)

Dec 14 at 23:07 Water 163
2
1
219
views

2
2
125
views

2
0
152
views

Why is it true that given a monotonic heuristic function, A* can be seen as Dijkstra's algorithm where no node needs to be processed more than once?

Jan 21 '19 at 7:35 maksadbek 125
2
1
561
views

2
1
47
views

2
2
166
views

2
0
30
views

Knapsack problem with specified amount of objects

Jul 8 '19 at 20:52 wwl 121
2
2
343
views

2
1
270
views

2
1