5606 search results - page 376 / 1122 » Randomization Techniques for Graphs. |
173
click to vote
WAW
2004
Springer
16 years 10 hour ago
2004
Springer
d Abstract) Paolo Boldi† Massimo Santini‡ Sebastiano Vigna∗ Deciding which kind of visit accumulates high-quality pages more quickly is one of the most often debated issue i...
179
click to vote
ASUNAM
2010
IEEE
15 years 8 months ago
2010
IEEE
Subgraph matching is a key operation on graph data. Social network (SN) providers may want to find all subgraphs within their social network that "match" certain query gr...
174
click to vote
WAW
2009
Springer
16 years 1 months ago
2009
Springer
Since the first investigations on web graph compression, it has been clear that the ordering of the nodes of the graph has a fundamental influence on the compression rate (usuall...
165
click to vote
ICCV
2003
IEEE
15 years 12 months ago
2003
IEEE
This paper is concerned with computing graph edit distance. One of the criticisms that can be leveled at existing methods for computing graph edit distance is that it lacks the fo...
198
click to vote
SOCIALCOM
2010
15 years 4 months ago
2010
A representation of the World Wide Web as a directed graph, with vertices representing web pages and edges representing hypertext links, underpins the algorithms used by web search...