990 search results - page 89 / 198 » Sub-Graphs of Complete Graph |
123
Voted
SIGMOD
2010
ACM
15 years 7 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...
120
Voted
FASE
2008
Springer
15 years 4 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...
133
click to vote
JCO
2007
15 years 2 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...
129
Voted
CIKM
2006
Springer
15 years 6 months 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...
128
click to vote
KDD
2009
ACM
16 years 2 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...