941 search results - page 31 / 189 » Efficient Testing of Large Graphs |
AIRWEB
2009
Springer
15 years 4 months ago
2009
Springer
Spammers in social bookmarking systems try to mimick bookmarking behaviour of real users to gain the attention of other users or search engines. Several methods have been proposed...
86
Voted
CEC
2008
IEEE
15 years 4 months ago
2008
IEEE
—As more and more real-world optimization problems become increasingly complex, algorithms with more capable optimizations are also increasing in demand. For solving large scale ...
ECCC
2010
14 years 7 months ago
2010
We consider the reachability problem for a certain class of directed acyclic graphs embedded on surfaces. Let G(m, g) be the class of directed acyclic graphs with m = m(n) source ...
98
Voted
JCP
2008
14 years 9 months ago
2008
Existing frequent subgraph mining algorithms can operate efficiently on graphs that are sparse, have vertices with low and bounded degrees, and contain welllabeled vertices and edg...
ISCIS
2005
Springer
15 years 3 months ago
2005
Springer
Dense subgraphs of sparse graphs (communities), which appear in most real-world complex networks, play an important role in many contexts. Computing them however is generally expe...