Covering Large Complex Networks by Cliques—A Sparse Matrix Approach-Reference-Cited by-同舟云学术

Covering Large Complex Networks by Cliques—A Sparse Matrix Approach

Published:2021 Issue: Volume: Page:117-127
ISSN:2194-1009
Container-title:Springer Proceedings in Mathematics & Statistics
language:
Short-container-title:

Author:

Abdullah W. M.,Hossain S.,Khan M. A.

Publisher

Springer International Publishing

Link

https://link.springer.com/content/pdf/10.1007/978-3-030-63591-6_11

Reference19 articles.

1. Kepner, J., Gilbert, J.: Graph Algorithms in the Language of Linear Algebra. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA (2011)

2. Gramm, J., Guo, J., Hüffner, F., Niedermeier, R.: Data reduction and exact algorithms for clique cover. J. Exp. Algorithmics (JEA). 13, 2–15 (2009)

3. Hossain, S., Khan, A.I.: Exact coloring of sparse matrices. In: Kilgour, D.M., et al. (eds.) Recent Advances in Mathematical and Statistical Methods. Springer Proceedings in Mathematics and Statistics, vol. 259, pp. 23–36. Springer Nature, Switzerland AG (2018)

4. Kepner, J., Jananthan, H.: Mathematics of Big Data: Spreadsheets, Databases, Matrices, and Graphs. MIT Press (2018)

5. Hasan, M., Hossain, S., Khan, A.I., Mithila, N.H., Suny, A.H.: DSJM: a software toolkit for direct determination of sparse Jacobian matrices. In: Greuel, G.M., Koch, T., Paule, P., Sommese, A. (eds.) ICMS2016, pp. 425–434. Springer International Publishing, Switzerland (2016)

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A Sparse Matrix Approach for Covering Large Complex Networks by Cliques;Computational Science – ICCS 2022;2022

2. Intersection Representation of Big Data Networks and Triangle Enumeration;Computational Science – ICCS 2022;2022

3. Intersection Representation of Big Data Networks and Triangle Counting;2021 IEEE International Conference on Big Data (Big Data);2021-12-15