Graph Node Connection Significance via Detour Path Analysis

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

The nature of connections between nodes in a graph data structure, particularly for non-neighboring nodes, is often not fully understood, limiting the depth of analysis and insight into relationships.

Innovation Solution

The method calculates the significance of intermediary entities within a path between two nodes by determining the difference between the original path and a detour path that does not include the intermediary entity, allowing for a deeper understanding of the connection.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Loss of information

If traditional graph traversal methods are used to find connections between nodes, then the basic path information can be obtained, but the nature and significance of the connection cannot be fully understood

Engineering Contradiction:
Improveconnection nature informationVSAvoidanalysis complexity
Core Design Contradiction:
Loss of informationVSDevice complexity

Solution Approach 1:

The patent segments the connection analysis by identifying and evaluating individual intermediary entities (nodes and edges) along the path between two nodes. Each intermediary entity is assessed independently for its significance contribution, allowing the overall connection nature to be understood through composition of these segmented evaluations.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent introduces intermediary entities (nodes and edges) as mediators in the connection analysis between two nodes. By evaluating the significance of these intermediary entities, the system reveals the nature of the connection that would otherwise be hidden in traditional path-finding approaches.

Inventive Principle:
Principle #24Intermediary (Mediator)

2Measurement precision

If the significance of intermediary entities is calculated by comparing original path with detour path, then deeper insight into connection nature is achieved, but additional computational steps are required

Engineering Contradiction:
Improveconnection analysis precisionVSAvoidcomputational complexity
Core Design Contradiction:
Measurement precisionVSDevice complexity

Solution Approach 1:

The patent performs preliminary actions by first identifying the original path between two nodes and then systematically generating detour paths that exclude specific intermediary entities. This preliminary path analysis enables subsequent significance calculation without requiring complex real-time computations.

Inventive Principle:
Principle #10Preliminary action

Solution Approach 2:

The patent changes the evaluation parameter from simple path existence to path significance by introducing a comparative metric. The significance of intermediary entities is determined by measuring the difference between the original path and detour paths, transforming qualitative connection analysis into quantitative evaluation.

Inventive Principle:
Principle #35Parameter changes

Data Source

PatentUS12299011B2Connection nature between nodes in graph structure
Publication Date: 2025.05.13 MICROSOFT TECHNOLOGY LICENSING LLC
  • US12299011B2 patent drawing
  • US12299011B2 patent drawing
  • US12299011B2 patent drawing

AI summary

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.