Sciweavers

2463 search results - page 28 / 493
» Rankings of Directed Graphs
Sort
View
GBRPR
2005
Springer
14 years 1 months ago
A Direct Algorithm to Find a Largest Common Connected Induced Subgraph of Two Graphs
Abstract. We present a direct algorithm that computes a largest common connected induced subgraph of two given graphs. It is based on an efficient generation of the common connecte...
Bertrand Cuissart, Jean-Jacques Hébrard
IM
2007
13 years 7 months ago
Ranking Websites: A Probabilistic View
In this paper we suggest evaluating the importance of a website with the mean frequency of visiting the website for the Markov chain on the Internet Graph describing random surfi...
Ying Bao, Guang Feng, Tie-Yan Liu, Zhiming Ma, Yin...
WG
2007
Springer
14 years 1 months ago
Characterization and Recognition of Digraphs of Bounded Kelly-width
Kelly-width is a parameter of directed graphs recently proposed by Hunter and Kreutzer as a directed analogue of treewidth. We give several alternative characterizations of direct...
Daniel Meister, Jan Arne Telle, Martin Vatshelle
VALUETOOLS
2006
ACM
166views Hardware» more  VALUETOOLS 2006»
14 years 1 months ago
Web graph analyzer tool
We present the software tool “Web Graph Analyzer”. This tool is designed to perform a comprehensive analysis of the Web Graph structure. By Web Graph we mean a graph whose ver...
Konstantin Avrachenkov, Danil Nemirovsky, Natalia ...