Santa Clara, CA, United States of America

Ning Ruan

USPTO Granted Patents = 1 

Average Co-Inventor Count = 2.0

ph-index = 1

Forward Citations = 5(Granted Patents)


Company Filing History:


Years Active: 2019

Loading Chart...
1 patent (USPTO):Explore Patents

Title: Innovations by Ning Ruan in Shortest Path Computation

Introduction

Ning Ruan is an accomplished inventor based in Santa Clara, California. He has made significant contributions to the field of computer science, particularly in the area of network optimization. His innovative work focuses on determining the shortest distance between vertices in large graphs, which has important applications in various industries.

Latest Patents

Ning Ruan holds a patent for a method titled "Shortest path computation in large networks." This patent outlines systems, methods, and software designed to efficiently determine the shortest distance between nodes in relatively large graphs. The method involves identifying an original graph with multiple nodes and edges, selecting hub nodes, creating a hub matrix, and calculating the shortest distance between nodes using this information.

Career Highlights

Ning Ruan is affiliated with Kent State University, where he continues to advance his research and development in network optimization. His work has garnered attention for its practical applications in improving network efficiency and performance.

Collaborations

Ning Ruan collaborates with Ruoming Jin, a fellow researcher who contributes to his projects and enhances the scope of their work. Their partnership exemplifies the collaborative spirit in academic research.

Conclusion

Ning Ruan's innovative contributions to shortest path computation demonstrate his expertise and commitment to advancing technology in network optimization. His work not only enhances theoretical understanding but also has practical implications for various applications.

This text is generated by artificial intelligence and may not be accurate.
Please report any incorrect information to support@idiyas.com
Loading…