Pashanasangi, Noujan
- Linear Time Subgraph Counting, Graph Degeneracy, and the Chasm at Size\n Six
2019/11/13 by Suman K. Bera, Bera, Suman K., Noujan Pashanasangi +3 · 5 citations
Computer Science · Materials Science · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Nanocluster Synthesis and Applications
- Efficiently Counting Vertex Orbits of All 5-vertex Subgraphs, by EVOKE
2019/11/24 by Noujan Pashanasangi, Pashanasangi, Noujan, C. Seshadhri +1 · 3 citations
Physics and Astronomy · Mathematics · Computer Science · #Complex Network Analysis Techniques #Graph theory and applications #Topological and Geometric Data Analysis
- Faster and Generalized Temporal Triangle Counting, via Degeneracy Ordering
2021/06/05 by Noujan Pashanasangi, Pashanasangi, Noujan, C. Seshadhri +1 · 2 citations
Computer Science · Physics and Astronomy · #Caching and Content Delivery #Complex Network Analysis Techniques #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Peer-to-Peer Network Technologies #Social and Information Networks (cs.SI)
- Near-Linear Time Homomorphism Counting in Bounded Degeneracy Graphs: The\n Barrier of Long Induced Cycles
2020/10/15 by Suman K. Bera, Noujan Pashanasangi, Bera, Suman K. +3 · 2 citations
Mathematics · Computer Science · #Markov Chains and Monte Carlo Methods #Advanced Graph Theory Research #Graph theory and applications