.png){kind=icon}
返回
.png){kind=icon}
.png){kind=icon}
摘要
En 中文
Measuring the connection strength between a pair of vertices in a graph is one of the most important concerns in many graph applications. Simple measures such as edge weights may not be sufficient for capturing the effects associated with short paths of lengths greater than one. In this paper, we consider an iterative process that smooths an associated value for nearby vertices, and we present a measure of the local connection strength (called the algebraic distance; see [D. Ron, I. Safro, and A. Brandt, Multiscale Model. Simul., 9 (2011), pp. 407-423]) based on this process. The proposed measure is attractive in that the process is simple, linear, and easily parallelized. An analysis of the convergence property of the process reveals that the local neighborhoods play an important role in determining the connectivity between vertices. We demonstrate the practical effectiveness of the proposed measure through several combinatorial optimization problems on graphs and hypergraphs.
Keyword:
graph connectivity measure
combinatorial scientific computing
stationary iterative process
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
2.6
论文数:
5.1K
被引数:
1.8W
机构
引用论文
Tinnitus Retraining Therapy (TRT) as a Method for Treatment of Tinnitus and Hyperacusis Patients耳鸣再训练疗法 (TRT) 作为治疗耳鸣和高亢患者的方法.png)
PREAI
.png){kind=icon}
分享.png){kind=icon}
收藏分享收藏分享收藏
Mechanical characterization of neural electrodes based on PDMS-parylene C-PDMS sandwiched system
PREAI
分享收藏Synthesis and characterization of screen -coated nickel selenide films for semiconductor device application.png)
Optik
OptikIF0
PREAI
分享收藏分享收藏 没有更多内容
没有更多内容