Network profile

maksadbek

Reputation

137

137
131
125

Jun
Sep
Dec
Mar

Top tag

correctness-proof

Next privilege

250 Rep.

View close votes

Badges

7

Newest

Benefactor

Next badge

0/1

Impact

0 posts edited

0 helpful flags

11 votes cast

Questions (6)

Votes Activity Newest

4	Mistake in a proof of termination phase of Simplex algorithm in CLRS?
2	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?
1	Explain the proof of allocation problem
1	Why CLRS example on residual networks does not follows its formula?
0	Confused with the proof that Edmonds-Karp always monotically increases the shortest-paths

View more →

Reputation (137)

+10	Explain the proof of allocation problem
+40	Mistake in a proof of termination phase of Simplex algorithm in CLRS?
+10	Why CLRS example on residual networks does not follows its formula?
+10	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?

View more →

Answers (0)

Votes Activity Newest

This user has not answered any questions

Tags (7)

0 correctness-proof × 4	0 graphs × 2
0 algorithms × 3	0 linear-programming
0 network-flow × 2	0 search-algorithms
0 shortest-path × 2

Bookmarks (1)

Votes Activity Newest Views Added

7	Why do we need to run the bellman-ford algorithm for n-1 times?

Accounts (36)

	Stack Overflow	1,105 rep	1 gold badge13 silver badges23 bronze badges
	Code Review	281 rep	1 silver badge7 bronze badges
	Server Fault	158 rep	5 bronze badges
	Computer Science	137 rep	7 bronze badges
	Game Development	103 rep	3 bronze badges

Badges (7)

Recent Class Name

Benefactor	Supporter
Promoter	Student
Scholar	Autobiographer
Editor

Active bounties (0)

Active Offered Earned

This user has no active bounties

Votes cast (11)

all time			by type
11	up		4	question
0	down		7	answer

Computer Science Stack Exchange works best with JavaScript enabled