2304 search results - page 20 / 461 » On the Vulnerability of Large Graphs |
KDD
2006
ACM
14 years 10 months ago
2006
ACM
Frequent coherent subgraphscan provide valuable knowledgeabout the underlying internal structure of a graph database, and mining frequently occurring coherent subgraphs from large...
PVLDB
2010
13 years 8 months ago
2010
The identiļ¬cation of clusters, well-connected components in a graph, is useful in many applications from biological function prediction to social community detection. However, ļ...
GC
2008
Springer
13 years 9 months ago
2008
Springer
We prove that for graphs of order n, minimum degree 2 and girth g 5 the domination number satisfies 1 3 + 2 3g n. As a corollary this implies that for cubic graphs of order n ...
SIGMOD
2008
ACM
14 years 9 months ago
2008
ACM
ICDM
2007
IEEE
14 years 4 months ago
2007
IEEE
āDeļ¬ning the support (or frequency) of a subgraph is trivial when a database of graphs is given: it is simply the number of graphs in the database that contain the subgraph. Ho...