REDUCING COMPLEXITY OF WORKFLOW GRAPHS THROUGH VERTEX GROUPING AND CONTRACTION

    公开(公告)号:US20210286644A1

    公开(公告)日:2021-09-16

    申请号:US16815980

    申请日:2020-03-11

    Abstract: Systems, methods, and computer-readable media for generating and presenting workflow graphs can include the following operations. A workflow graph including vertices is provided. An event is received to reorganize the vertices of the workflow graph. Each of the vertices is classified with a significance level, the significance level is based on at least one of a business rule and a vertex position of a vertex of the vertices. Vertices of the vertices having a low significance level are grouped together. The vertices in the group having the low significance level are combined into a new vertex, and the new vertex is expandable and collapsible to view the vertices in the group having the low significance level.

    Reducing complexity of workflow graphs through vertex grouping and contraction

    公开(公告)号:US11681545B2

    公开(公告)日:2023-06-20

    申请号:US16815980

    申请日:2020-03-11

    CPC classification number: G06F9/4843 G06F16/2246 G06F16/287

    Abstract: Systems, methods, and computer-readable media for generating and presenting workflow graphs can include the following operations. A workflow graph including vertices is provided. An event is received to reorganize the vertices of the workflow graph. Each of the vertices is classified with a significance level, the significance level is based on at least one of a business rule and a vertex position of a vertex of the vertices. Vertices of the vertices having a low significance level are grouped together. The vertices in the group having the low significance level are combined into a new vertex, and the new vertex is expandable and collapsible to view the vertices in the group having the low significance level.

Patent Agency Ranking