394 search results - page 44 / 79 » Testing subgraphs in large graphs |
WWW
2007
ACM
14 years 8 months ago
2007
ACM
The World Wide Web (WWW) is rapidly becoming important for society as a medium for sharing data, information and services, and there is a growing interest in tools for understandi...
SODA
2010
ACM
14 years 5 months ago
2010
ACM
There has been great interest in deciding whether a combinatorial structure satisfies some property, or in estimating the value of some numerical function associated with this com...
AC
2000
Springer
14 years 5 days ago
2000
Springer
The management of large databases of hierarchical (e.g., multi-scale or multilevel) image features is a common problem in object recognition. Such structures are often represented ...
SODA
2012
ACM
11 years 10 months ago
2012
ACM
Given a class of graphs F, we say that a graph G is universal for F, or F-universal, if every H ∈ F is contained in G as a subgraph. The construction of sparse universal graphs ...
WDAG
2009
Springer
14 years 2 months ago
2009
Springer
Given an undirected graph and 0 ≤ ≤ 1, a set of nodes is called -near clique if all but an fraction of the pairs of nodes in the set have a link between them. In this paper we...