Focal Interest
Focal Interest

Graph Theory and Algorithms

External reference: https://openalex.org/T12292

  1. Logarithmic-time pattern matching for compressed and dynamic texts
    Study introduces O(log n)-time algorithms for Internal Pattern Matching queries on compressed and dynamic strings using recompression-based representations.
  2. HKEN improved influential-node identification in network tests
    Algorithm for identifying influential nodes in complex networks by integrating hierarchical k-shell decomposition with extended neighborhood analysis, validated against SIR propagation models.