796 search results - page 114 / 160 » Graph Properties Based Filtering |
124
click to vote
AINA
2003
IEEE
15 years 7 months ago
2003
IEEE
This paper endeavors to present a scheme to detect and estimate bottleneck bandwidth along the path in the Internet. We have participated in the RIPE NCC’s TTM project to perfor...
133
Voted
ACSW
2006
15 years 3 months ago
2006
Computational grids are now widespread, but their large-scale behaviour is still poorly understood. We report on some calculations of loading, scaling and utilisation behaviours o...
105
click to vote
MST
2007
15 years 2 months ago
2007
Crown structures in a graph are defined and shown to be useful in kernelization algorithms for the classic vertex cover problem. Two vertex cover kernelization methods are discus...
142
click to vote
JAIR
2010
14 years 9 months ago
2010
The Hamiltonian cycle problem (HCP) is an important combinatorial problem with applications in many areas. It is among the first problems used for studying intrinsic properties, i...
129
Voted
VLDB
2004
ACM
15 years 7 months ago
2004
ACM
Link analysis methods show that the interconnections between web pages have lots of valuable information. The link analysis methods are, however, inherently oriented towards analy...