Y
Yinghui Wu
Researcher at Case Western Reserve University
Publications - 106
Citations - 3273
Yinghui Wu is an academic researcher from Case Western Reserve University. The author has contributed to research in topics: Graph (abstract data type) & Computer science. The author has an hindex of 27, co-authored 92 publications receiving 2759 citations. Previous affiliations of Yinghui Wu include Washington State University & University of California, Santa Barbara.
Papers
More filters
Journal ArticleDOI
Graph pattern matching: from intractable to polynomial time
TL;DR: It is shown that with this revision, graph pattern matching can be performed in cubic-time, by providing such an algorithm and developing algorithms for incrementally finding matches when data graphs are updated, with performance guarantees for dag patterns.
Graph Pattern Matching.
Yinghui Wu,Arijit Khan +1 more
TL;DR: In this article, a class of graph patterns, called dag patterns, is proposed, in which an edge denotes the connectivity in a data graph within a predefined number of hops.
Proceedings ArticleDOI
Query preserving graph compression
TL;DR: Graphs can be efficiently compressed via a reachability equivalence relation and graph bisimulation, respectively, while reserving query answers, and are reduced in average by 95% for reachability and 57% for graph pattern matching.
Proceedings ArticleDOI
Adding regular expressions to graph reachability and pattern queries
TL;DR: A class of reachability queries and a class of graph patterns, in which an edge is specified with a regular expression of a certain form, expressing the connectivity in a data graph via edges of various types are proposed.
Journal ArticleDOI
NeMa: fast graph search with label similarity
TL;DR: This paper proposes NeMa (Network Match), a neighborhood-based sub graph matching technique for querying real-life networks and proposes a novel subgraph matching cost metric that aggregates the costs of matching individual nodes, and unifies both structure and node label similarities.