2304 search results - page 20 / 461 » On the Vulnerability of Large Graphs |
KDD
2006
ACM
16 years 5 days 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
14 years 10 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, ļ...
109
click to vote
GC
2008
Springer
14 years 12 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 ...
ICDM
2007
IEEE
15 years 6 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...