187 citations · 365 across the 14 of their papers we have counts for
15 papers
Property Graphs in Arachne
Oliver Alvarado Rodriguez, Fernando Vera Buschmann, Zhihui Du +1
Analyzing large-scale graphs poses challenges due to their increasing size and the demand for interactive and user-friendly analytics tools. These graphs arise from various domains…
Parallel Longest Common SubSequence Analysis In Chapel
Soroush Vahidi, Baruch Schieber, Zhihui Du +1
One of the most critical problems in the field of string algorithms is the longest common subsequence problem (LCS). The problem is NP-hard for an arbitrary number of strings but c…
End-to-end resource analysis for quantum interior point methods and portfolio optimization
Alexander M. Dalzell, B. David Clader, Grant Salton +8
We study quantum interior point methods (QIPMs) for second-order cone programming (SOCP), guided by the example use case of portfolio optimization (PO). We provide a complete quant…
Triangle Counting Through Cover-Edges
David A. Bader, Fuhuan Li, Anya Ganeshan +4
Counting and finding triangles in graphs is often used in real-world analytics to characterize cohesiveness and identify communities in graphs. In this paper, we propose the novel…
Design and Implementation of Knowledge Base for Runtime Management of Software Defined Hardware
Hongkuan Zhou, Ajitesh Srivastava, Rajgopal Kannan +1
Runtime-reconfigurable software coupled with reconfigurable hardware is highly desirable as a means towards maximizing runtime efficiency without compromising programmability. Comp…
A Simple and Efficient Algorithm for Finding Minimum Spanning Tree Replacement Edges
David A. Bader, Paul Burkhardt
Given an undirected, weighted graph, the minimum spanning tree (MST) is a tree that connects all of the vertices of the graph with minimum sum of edge weights. In real world applic…