18244440. CONNECTION NATURE BETWEEN NODES IN GRAPH STRUCTURE simplified abstract (Microsoft Technology Licensing, LLC)

From WikiPatents
Jump to navigation Jump to search

CONNECTION NATURE BETWEEN NODES IN GRAPH STRUCTURE

Organization Name

Microsoft Technology Licensing, LLC

Inventor(s)

Leo Moreno Betthauser of Kirkland WA (US)

Maurice Diesendruck of Bellevue WA (US)

Harsh Shrivastava of Redmond WA (US)

CONNECTION NATURE BETWEEN NODES IN GRAPH STRUCTURE - A simplified explanation of the abstract

This abstract first appeared for US patent application 18244440 titled 'CONNECTION NATURE BETWEEN NODES IN GRAPH STRUCTURE

Simplified Explanation

The abstract describes a computing system that interprets a graph data structure by determining the most dominant intermediary entity (node or edge) on a path between a pair of nodes. The system calculates a detour path by removing the intermediary entity and compares it to the original path to determine the significance of the intermediary entity. Multiple intermediary entities can be evaluated in the same way.

  • The system interprets a graph data structure by analyzing the dominance of intermediary entities on a path between nodes.
  • It calculates a detour path by removing an intermediary entity and compares it to the original path.
  • The difference between the detour path and the original path determines the significance of the intermediary entity.
  • Multiple intermediary entities can be evaluated using this method.

Potential Applications

  • Network routing optimization: The system can be used to optimize network routing by identifying and prioritizing dominant intermediary entities in a graph data structure.
  • Transportation planning: It can be applied to optimize transportation routes by determining the most significant factors (intermediary entities) affecting travel time.
  • Social network analysis: The system can help analyze social networks by identifying the most influential nodes or edges in a graph data structure.

Problems Solved

  • Efficient interpretation of graph data: The system provides a method for interpreting graph data structures by determining the significance of intermediary entities.
  • Path optimization: By identifying the most dominant intermediary entities, the system can help optimize paths in various applications, such as network routing and transportation planning.

Benefits

  • Improved efficiency: The system allows for more efficient interpretation of graph data structures, leading to better decision-making and optimization.
  • Enhanced path optimization: By considering the significance of intermediary entities, the system can optimize paths by avoiding or prioritizing certain nodes or edges.
  • Better understanding of complex systems: The analysis of dominant intermediary entities provides insights into the importance and influence of different components in a graph data structure.


Original Abstract Submitted

The interpretation of a graph data structure represented on a computing system in which the connection between a pair of nodes in the graph may be interpreted by which intermediary entity (node or edge) on a path (e.g., a shortest path) between the node pair is most dominant. That is, if the intermediary entity were not present, a detour path is determined. The greater the difference between the detour path and the original path, the more significant that intermediary entity is. The significance of multiple intermediary entities in the original path may be determined in this way.

Retrieved from "http://wikipatents.org/index.php?title=18244440._CONNECTION_NATURE_BETWEEN_NODES_IN_GRAPH_STRUCTURE_simplified_abstract_(Microsoft_Technology_Licensing,_LLC)&oldid=17061"