An introduction to econophysics: correlations and complexity in finance
An introduction to econophysics: correlations and complexity in finance
Enumerating all connected maximal common subgraphs in two graphs
Theoretical Computer Science
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
Linear-time enumeration of isolated cliques
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Isolation concepts for enumerating dense subgraphs
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
Hi-index | 0.00 |
We do computational studies concerning the enumeration of maximal 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 than for the enumeration of maximal general cliques and in filtering out cliques with special semantics. We perform experiments with synthetic graphs (in the Gn,m,pmodel) and financial networks, proposing the enumeration of isolated cliques as a useful instrument in analyzing financial networks.