会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 100. 发明授权
    • Deriving a nested chain of densest subgraphs from a graph
    • 从图中导出最密集子图的嵌套链
    • US08799192B2
    • 2014-08-05
    • US13406843
    • 2012-02-28
    • Bin ZhangMeichun Hsu
    • Bin ZhangMeichun Hsu
    • G06F15/18
    • G06F17/30958
    • A nested chain of densest subgraphs is derived by a computer from a given graph that has multiple vertices and edges. The two ends of each edge are assigned with respective incident weights, and each vertex is given a vertex weight. A weight balancing process is carried out by the computer to iteratively go through the edges to adjust the incident weights of each edge and the vertex weights of the vertices connected by that edge to reduce a difference between the vertex weights of the two vertices. After the balancing, the vertex weights are put in an ordered sequence according to their values, and a nested chain of densest subgraphs is derived from the ordered sequence.
    • 密集子图的嵌套链由计算机从具有多个顶点和边的给定图导出。 每个边缘的两端被分配有相应的事件权重,并且每个顶点被赋予顶点权重。 计算机进行权重平衡处理,以迭代地遍历边缘,以调整每个边缘的入射权重和由该边连接的顶点的顶点权重,以减少两个顶点的顶点权重之间的差异。 在平衡之后,顶点权重根据它们的值被置于有序序列中,并且从有序序列导出嵌套的密集子图链。