TMFCS-09 call for papers
The 2009 International Conference on Theoretical and Mathematical
Foundations of Computer Science (TMFCS-09) (website:
http://www.PromoteResearch.org
) will be held during July 13-16 2009 in Orlando, FL, USA. We invite
draft paper submissions. The conference will take pl
Fibbonaci heaps are not the fastest way in practice, they are only
theoreticaly faster for large enough n.
I heard about some techniques where they are only integer numbers.
2008/12/7 TheTravellingSalesman <[EMAIL PROTECTED]>
>
> I was about to start implemening max flor min cut and shortest path
