990 search results - page 89 / 198 » Sub-Graphs of Complete Graph |
SIGMOD
2010
ACM
14 years 1 months ago
2010
ACM
Maximal clique enumeration (MCE) is a fundamental problem in graph theory and has important applications in many areas such as social network analysis and bioinformatics. The prob...
FASE
2008
Springer
13 years 10 months ago
2008
Springer
Abstract. The complexity of large system models in software engineering nowadays is mastered by using different views. View-based modeling aims at creating small, partial models, e...
JCO
2007
13 years 9 months ago
2007
This paper studies the group testing problem in graphs as follows. Given a graph G = (V, E), determine the minimum number t(G) such that t(G) tests are sufficient to identify an u...
CIKM
2006
Springer
14 years 22 days ago
2006
Springer
The wide adoption of XML has increased the interest of the database community on tree-structured data management techniques. Querying capabilities are provided through tree-patter...
KDD
2009
ACM
14 years 9 months ago
2009
ACM
We present a new approach to large-scale graph mining based on so-called backbone refinement classes. The method efficiently mines tree-shaped subgraph descriptors under minimum f...