92 search results - page 8 / 19 » Linked graphs with restricted lengths |
BROADNETS
2004
IEEE
13 years 11 months ago
2004
IEEE
Failure resilience is one of the desired features of the Internet. Most of the traditional restoration architectures are based on single-failure assumption which is unrealistic. M...
INFOVIS
2005
IEEE
14 years 1 months ago
2005
IEEE
The paper describes a novel technique to visualize graphs with extended node and link labels. The lengths of these labels range from a short phrase to a full sentence to an entire...
WEBI
2005
Springer
14 years 28 days ago
2005
Springer
This work presents a new perspective on characterizing the similarity between elements of a database or, more generally, nodes of a weighted, undirected, graph. It is based on a M...
WAW
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. Analysis of aggregate and individual Web requests shows that PageRank is a poor predictor of traffic. We use empirical data to characterize properties of Web traffic not ...
SODA
2010
ACM
14 years 4 months ago
2010
ACM
Many NP-hard problems can be solved efficiently when the input is restricted to graphs of bounded tree-width or clique-width. In particular, by the celebrated result of Courcelle,...