Enumerating isolated cliques in synthetic and financial networks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5165 LNCS, Issue , 2008, Pages 405-416

  Hüffner, Falk ^a   Komusiewicz, Christian ^a   Moser, Hannes ^a   Niedermeier, Rolf ^a  

^a FRIEDRICH SCHILLER UNIVERSITY JENA   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BEVERAGES; COMBINATORIAL MATHEMATICS; COMBINATORIAL OPTIMIZATION; COMPUTATIONAL LINGUISTICS; INFORMATION THEORY; OPTIMIZATION;

COMPUTATIONAL STUDIES; FINANCIAL NETWORKS; INTERNATIONAL CONFERENCES; ISOLATED CLIQUES; SYNTHETIC GRAPHS;

GRAPH THEORY;

EID: 51849092675     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-85097-7_38     Document Type: Conference Paper

References (14)

1. 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)
2. Behrisch, M., Taraz, A.: Efficiently covering complex networks with cliques of similar vertices. Theoret. Comput. Sci. 355(1), 37-47 (2006)
3. Boginski, V., Butenko, S., Pardalos, P.M.: Statistical analysis of financial networks. Comput. Statist. Data Anal. 48(2), 431-443 (2005)
4. Boginski, V., Butenko, S., Pardalos, P.M.: Mining market data: A network approach. Comput. Oper. Res. 33(11), 3171-3184 (2006)
5. Butenko, S., Wilhelm, W.E.: Clique-detection models in computational biochemistry and genomics. European J. Oper. Res. 173(1), 1-17 (2006)
6. 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)
7. Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)
8. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, New York (1979)
9. 1-ε. Acta Math. 182(1), 105-142 (1999)
10. 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)
11. Koch, I.: Enumerating all connected maximal common subgraphs in two graphs. Theoret. Comput. Sci. 250(1-2), 1-30 (2001)
12. 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)
13. Mantegna, R.N., Stanley, H.E.: Introduction to Econophysics: Correlations and Complexity in Finance. Cambridge University Press, Cambridge (2000)
14. 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)