网站首页  英汉词典

请输入您要查询的英文单词:

 

单词 Dense subgraph
释义

Dense subgraph

英语百科

Dense subgraph

In computer science the notion of highly connected subgraphs appears frequently. This notion can be formalized as follows. Let G=(E,V) be an undirected graph and let S=(E_{S},V_{S}) be a subgraph of G. Then the density of S is defined to be d(S)={|E_{S}| \over |V_{S}|}.

The densest subgraph problem is that of finding a subgraph of maximum density. In 1984, Andrew V. Goldberg developed a polynomial time algorithm to find the maximum density subgraph using a max flow technique.

随便看

 

英汉网英语在线翻译词典收录了3779314条英语词汇在线翻译词条,基本涵盖了全部常用英语词汇的中英文双语翻译及用法,是英语学习的有利工具。

 

Copyright © 2004-2024 encnc.com All Rights Reserved
更新时间:2025/6/18 13:08:41