Abstract
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 G n,m,p model) and financial networks, proposing the enumeration of isolated cliques as a useful instrument in analyzing financial networks.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abu-Khzam, F.N., Collins, R.L., Fellows, M.R., Langston, M.A., Suters, W.H., Symons, C.T.: Kernelization algorithms for the vertex cover problem: Theory and experiments. In: Proc. 6th ALENEX, pp. 62–69. SIAM, Philadelphia (2004)
Behrisch, M., Taraz, A.: Efficiently covering complex networks with cliques of similar vertices. Theoret. Comput. Sci. 355(1), 37–47 (2006)
Boginski, V., Butenko, S., Pardalos, P.M.: Statistical analysis of financial networks. Comput. Statist. Data Anal. 48(2), 431–443 (2005)
Boginski, V., Butenko, S., Pardalos, P.M.: Mining market data: A network approach. Comput. Oper. Res. 33(11), 3171–3184 (2006)
Butenko, S., Wilhelm, W.E.: Clique-detection models in computational biochemistry and genomics. European J. Oper. Res. 173(1), 1–17 (2006)
Chesler, E.J., Lu, L., Shou, S., Qu, Y., Gu, J., Wang, J., Hsu, H.C., Mountz, J.D., Baldwin, N.E., Langston, M.A., Threadgill, D.W., Manly, K.F., Williams, R.W.: Complex trait analysis of gene expression uncovers polygenic and pleiotropic networks that modulate nervous system function. Nat. Genet. 37(3), 233–242 (2005)
Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, New York (1979)
Håstad, J.: Clique is hard to approximate within n 1 − ε. Acta Math. 182(1), 105–142 (1999)
Ito, H., Iwama, K., Osumi, T.: Linear-time enumeration of isolated cliques. In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol. 3669, pp. 119–130. Springer, Heidelberg (2005)
Koch, I.: Enumerating all connected maximal common subgraphs in two graphs. Theoret. Comput. Sci. 250(1–2), 1–30 (2001)
Komusiewicz, C., Hüffner, F., Moser, H., Niedermeier, R.: Isolation concepts for enumerating dense subgraphs. In: Lin, G. (ed.) COCOON. LNCS, vol. 4598, pp. 140–150. Springer, Heidelberg (2007)
Mantegna, R.N., Stanley, H.E.: Introduction to Econophysics: Correlations and Complexity in Finance. Cambridge University Press, Cambridge (2000)
Tomita, E., Tanaka, A., Takahashi, H.: The worst-case time complexity for generating all maximal cliques and computational experiments. Theoret. Comput. Sci. 363(1), 28–42 (2006)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hüffner, F., Komusiewicz, C., Moser, H., Niedermeier, R. (2008). Enumerating Isolated Cliques in Synthetic and Financial Networks. In: Yang, B., Du, DZ., Wang, C.A. (eds) Combinatorial Optimization and Applications. COCOA 2008. Lecture Notes in Computer Science, vol 5165. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85097-7_38
Download citation
DOI: https://doi.org/10.1007/978-3-540-85097-7_38
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-85096-0
Online ISBN: 978-3-540-85097-7
eBook Packages: Computer ScienceComputer Science (R0)