941 search results - page 3 / 189 » Efficient Testing of Large Graphs |
RSA
2002
13 years 8 months ago
2002
Let H be a fixed graph with h vertices, let G be a graph on n vertices and suppose that at least n2 edges have to be deleted from it to make it H-free. It is known that in this ca...
SIGMOD
2008
ACM
14 years 8 months ago
2008
ACM
DATE
2006
IEEE
14 years 6 days ago
2006
IEEE
The clock latency scheduling problem is usually solved on the sequential graph, also called register-to-register graph. In practice, the the extraction of the sequential graph for...
ECCC
2007
13 years 8 months ago
2007
We study graph properties which are testable for bounded degree graphs in time independent of the input size. Our goal is to distinguish between graphs having a predetermined grap...
SIGMOD
2007
ACM
14 years 8 months ago
2007
ACM
Graphs are prevalently used to model the relationships between objects in various domains. With the increasing usage of graph databases, it has become more and more demanding to e...