54 search results - page 8 / 11 » Forcing highly connected subgraphs |
SIGMETRICS
2005
ACM
15 years 3 months ago
2005
ACM
—To model P2P networks that are commonly faced with high rates of churn and random departure decisions by end-users, this paper investigates the resilience of random graphs to li...
WAIM
2007
Springer
15 years 3 months ago
2007
Springer
The HITS algorithm proposed by Kleinberg is one of the representative methods of scoring Web pages by using hyperlinks. In the days when the algorithm was proposed, most of the pag...
BMCBI
2008
14 years 9 months ago
2008
Background: Graphs and networks are common analysis representations for biological systems. Many traditional graph algorithms such as k-clique, k-coloring, and subgraph matching h...
ICEIS
2009
IEEE
15 years 4 months ago
2009
IEEE
One of the most difficult tasks in the design of information systems is how to control the behaviour of the back-end storage engine, usually a relational database. As the load on t...
72
Voted
ACMACE
2006
ACM
15 years 3 months ago
2006
ACM
Internet Pajama is a novel wearable system aimed at promoting physical interaction in remote communication between parent and child. This system enables parent and child to hug on...