Search found 3 matches

by m_thimma
Mon May 22, 2006 6:06 pm
Forum: Volume 7 (700-799)
Topic: 796 - Critical Links
Replies: 54
Views: 23044

this problem is killing me by giving wa....i solved similar bridge detection problem (610) without any difficulty...i would appreciate some help my algo : 1) start with some unvisited vertex and find all bridges in that conncected component using depth first search 2) in bridge procedure(in my progr...
by m_thimma
Thu May 11, 2006 11:03 am
Forum: Volume 100 (10000-10099)
Topic: 10092 - The Problem with the Problem Setter
Replies: 31
Views: 12800

i used edmond-karps algrorithm...
i got a timelimit of 0.033sec for software allocation...
i used same alg with little modifications to this problem....
but i am getting 2.5sec....
can anyone suggest some ways to reduce my running time
by m_thimma
Thu May 11, 2006 7:03 am
Forum: Volume 2 (200-299)
Topic: 259 - Software Allocation
Replies: 28
Views: 10852

i used the following alg: 0-9 indicates different computers 10-35 indicates applications 36 is source,37 destination 1)i constructed network with above conventions and the weights of edges between source and applications is the no of users bringing that application and all the othere edges weights a...

Go to advanced search