Balancing collections of vertices in a network
    1.
    发明申请
    Balancing collections of vertices in a network 有权
    平衡网络中顶点的集合

    公开(公告)号:US20080218518A1

    公开(公告)日:2008-09-11

    申请号:US11714509

    申请日:2007-03-06

    IPC分类号: G06T11/20

    CPC分类号: G06F17/11 H04L45/48

    摘要: A representation of a network having vertices connected by arcs is provided. Different collections of vertices in the network are iteratively selected. Balancing moves are performed in corresponding collections of the network, where the collections are represented by corresponding graphs according to a predefined structure.

    摘要翻译: 提供了具有通过弧连接的顶点的网络的表示。 迭代地选择网络中不同的顶点集合。 平衡移动在网络的相应集合中执行,其中集合由根据预定义结构的对应图表示。

    Balancing collections of vertices in a network
    2.
    发明授权
    Balancing collections of vertices in a network 有权
    平衡网络中顶点的集合

    公开(公告)号:US07742906B2

    公开(公告)日:2010-06-22

    申请号:US11714509

    申请日:2007-03-06

    IPC分类号: G06F17/50

    CPC分类号: G06F17/11 H04L45/48

    摘要: A representation of a network having vertices connected by arcs is provided. Different collections of vertices in the network are iteratively selected. Balancing moves are performed in corresponding collections of the network, where the collections are represented by corresponding graphs according to a predefined structure.

    摘要翻译: 提供了具有通过弧连接的顶点的网络的表示。 迭代地选择网络中不同的顶点集合。 平衡移动在网络的相应集合中执行,其中集合由根据预定义结构的对应图表示。

    Identifying a minimum cut and/or a maximum flow using balancing of vertex excesses
    3.
    发明授权
    Identifying a minimum cut and/or a maximum flow using balancing of vertex excesses 有权
    使用平衡顶点过剩来识别最小切割和/或最大流量

    公开(公告)号:US07680641B1

    公开(公告)日:2010-03-16

    申请号:US11450706

    申请日:2006-06-09

    IPC分类号: G06F17/50

    摘要: A representation of a network having vertices connected by arcs is provided, where the network exhibits a pseudoflow. Arcs on which moves are to be performed are iteratively chosen for balancing excesses of vertices across the arcs until a stopping rule is satisfied. After the stopping rule is satisfied, further processing is performed to identify at least one of a minimum cut and/or maximum flow.

    摘要翻译: 提供具有通过弧连接的顶点的网络的表示,其中网络呈现伪浪。 要对其进行移动的弧进行迭代选择,以平衡跨弧的顶点过多直到达到停止规则。 在满足停止规则之后,执行进一步的处理以识别最小切割和/或最大流动中的至少一个。