For a complete graph (or one that is almost complete), if our dara is an 11 X 11
Chapter 23, Problem 23.1.87(choose chapter or problem)
For a complete graph (or one that is almost complete), if our dara is an 11 X 11 distance table (as in Prob. 12, Sec. 23.4). sho'" that the present algorithm [which is 0(112)] cannot easily be replaced by an algorithm of order less than 0(/12 ).
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer