1395 search results - page 215 / 279 » (k, )-Distance-Hereditary Graphs |
CORR
2007
Springer
14 years 9 months ago
2007
Springer
—For a linear block code C, its stopping redundancy is defined as the smallest number of check nodes in a Tanner graph for C, such that there exist no stopping sets of size smal...
100
click to vote
SWAT
2010
Springer
14 years 8 months ago
2010
Springer
We study the problem of minimizing the diameter of a graph by adding k shortcut edges, for speeding up communication in an existing network design. We develop constant-factor appro...
160
click to vote
ICDE
2007
IEEE
15 years 11 months ago
2007
IEEE
It is widely realized that the integration of database and information retrieval techniques will provide users with a wide range of high quality services. In this paper, we study ...
154
click to vote
ICDE
2004
IEEE
15 years 11 months ago
2004
IEEE
XML and other types of semi-structured data are typically represented by a labeled directed graph. To speed up path expression queries over the graph, a variety of structural inde...
WWW
2005
ACM
15 years 10 months ago
2005
ACM
PageRank is defined as the stationary state of a Markov chain. The chain is obtained by perturbing the transition matrix induced by a web graph with a damping factor that spreads...