Combinatorial algorithms, structures and applications

组合算法、结构和应用

• 批准号: 217627-2008
• 负责人: Pike, David
• 金额: $ 0.87万
• 依托单位: Memorial University of Newfoundland
• 依托单位国家: 加拿大
• 项目类别: Discovery Grants Program - Individual
• 财政年份: 2009
• 资助国家: 加拿大
• 起止时间: 2009-01-01 至 2010-12-31
• 项目状态: 已结题
• 来源: https://www.nserc-crsng.gc.ca/ase-oro/Details-Detailles_eng.asp?id=424964
• 关键词: Combinatorial; algorithms; structures; applications

This program of research studies computational and theoretical problems in graphs and networks. Graphs and networks each consist of a collection of nodes, some pairs of which are connected by edges. As one example, consider the network that we can construct from the World Wide Web: let each webpage be represented by its own node and then join node A to node B if webpage A has a link to webpage B. This example, known as the Web Graph, contains the structural information of the web, but none of its content. One key question that we now want to ask is whether it is possible to find collections of webpages that share related content, when all we have to work with is the network structure of the Web Graph.

这个研究项目研究图和网络中的计算和理论问题。图和网络都由一组节点组成，其中一些节点对由边连接。举个例子，考虑一下我们可以从万维网构建的网络：让每个网页用它自己的节点表示，然后如果网页A有到网页B的链接，则将节点A连接到节点B。这个例子称为Web Graph，包含了网络的结构信息，但不包含其内容。我们现在想问的一个关键问题是，当我们所要处理的只是Web Graph的网络结构时，是否有可能找到共享相关内容的网页集合。