Efficient algorithms for subgraph counting and enumeration on large graphs

• المؤلف الرئيسي: Wang, Kaixin
• مؤلفون آخرون: Long Cheng
• التنسيق: Thesis-Doctor of Philosophy
• اللغة: English
• منشور في: Nanyang Technological University 2024
• الموضوعات: Computer and Information Science; Mathematics of computing; Graph algorithms
• الوصول للمادة أونلاين: https://hdl.handle.net/10356/176240

This thesis delves into critical challenges associated with subgraph analysis in large-scale graphs. The proliferation of data in domains such as social networks, Internet applications, and biological networks necessitates a deep understanding of relationships modeled as graphs. The complexity and s...