Invention Grant
- Patent Title: Switching matrix representation for an incremental algorithm computing connected components
-
Application No.: US15245463Application Date: 2016-08-24
-
Publication No.: US10558429B2Publication Date: 2020-02-11
- Inventor: Mauricio J. Serrano , Ilie Gabriel Tanase
- Applicant: International Business Machines Corporation
- Applicant Address: US NY Armonk
- Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
- Current Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
- Current Assignee Address: US NY Armonk
- Agency: Amin, Turocy & Watson, LLP
- Main IPC: G06F17/30
- IPC: G06F17/30 ; G06F7/20 ; G06F16/901 ; G06F16/951 ; G06F16/35 ; G06F16/28

Abstract:
Techniques for determining connected components of a graph via incremental graph analysis algorithms are provided. In one example, a computer-implemented method comprises analyzing, by a system operatively coupled to a processor, a first differential value representing an initial incremental difference of elements between selected initial elements of an initial vector and selected input elements of an input vector associated with a graph. The method further comprises recurringly analyzing, by the system, a second differential value representing a subsequent incremental difference of elements between selected updated elements of an updated initial vector and selected additional elements of another input vector associated with the graph until the second differential value is zero.
Public/Granted literature
- US20180060038A1 SWITCHING MATRIX REPRESENTATION FOR AN INCREMENTAL ALGORITHM COMPUTING CONNECTED COMPONENTS Public/Granted day:2018-03-01
Information query