Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  develop I/O-efficient algorithms for diameter and all-pairs shortest-paths (APSP). For general undirected graphs G(V, E) with non-negative edge ights and E/V = o(B/ log V) our approaches are the first to achieve o(V 2 ) I/Os.  also show that for unighted undirected graphs, APSP can be solved with just O(V . sort(E)) I/Os. Both our ighted and unighted approaches require O(V 2 ) space. For diameter computations  provide I/O-space tradeoffs. Finally,  provide improved results for both diameter and APSP computation on directed planar graphs.
['Lars Arge', 'Ulrich Meyer', 'Laura Toma']
I am writing a research paper on a idea External Memory Algorithms for Diameter and All-Pairs Shortest-Paths on Sparse Graphs
[{"from": "human", "value": "I am writing a research paper on a idea External Memory Algorithms for Diameter and All-Pairs Shortest-Paths on Sparse Graphs"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  develop I/O-efficient algorithms for diameter and all-pairs shortest-paths (APSP). For general undirected graphs G(V, E) with non-negative edge ights and E/V = o(B/ log V) our approaches are the first to achieve o(V 2 ) I/Os.  also show that for unighted undirected graphs, APSP can be solved with just O(V . sort(E)) I/Os. Both our ighted and unighted approaches require O(V 2 ) space. For diameter computations  provide I/O-space tradeoffs. Finally,  provide improved results for both diameter and APSP computation on directed planar graphs."}]