An introduction to econophysics: correlations and complexity in finance
An introduction to econophysics: correlations and complexity in finance
Efficient identification of Web communities
Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining
Enumerating all connected maximal common subgraphs in two graphs
Theoretical Computer Science
Algorithm 457: finding all cliques of an undirected graph
Communications of the ACM
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Efficiently covering complex networks with cliques of similar vertices
Theoretical Computer Science - Complex networks
Mining market data: a network approach
Computers and Operations Research
The worst-case time complexity for generating all maximal cliques and computational experiments
Theoretical Computer Science - Computing and combinatorics
A large-scale study of link spam detection by graph algorithms
AIRWeb '07 Proceedings of the 3rd international workshop on Adversarial information retrieval on the web
Note: A note on the problem of reporting maximal cliques
Theoretical Computer Science
Enumeration of isolated cliques and pseudo-cliques
ACM Transactions on Algorithms (TALG)
Isolation concepts for enumerating dense subgraphs
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
Exact combinatorial algorithms and experiments for finding maximum k-plexes
Journal of Combinatorial Optimization
| Hi-index | 5.24 |
We do computational studies concerning the enumeration of isolated cliques in graphs. Isolation, as recently introduced, measures the degree of connectedness of the cliques to the rest of the graph. Isolation helps both in getting faster algorithms for the enumeration of maximal general cliques and in filtering out cliques with special semantics. We compare three isolation concepts and their combination with two enumeration modi for maximal cliques (''isolated maximal'' vs ''maximal isolated''). All studied concepts exhibit the fixed-parameter tractability of the enumeration task with respect to the parameter ''degree of isolation''. We provide a first systematic experimental study of the corresponding enumeration algorithms, using synthetic graphs (in the G"n","m","p model), financial networks, and a music artist similarity network, proposing the enumeration of isolated cliques as a useful instrument in analyzing financial and social networks.