1 citations · 1 across the 7 of their papers we have counts for
3 papers · 1 filter
Time-Constrained Continuous Subgraph Matching Using Temporal Information for Filtering and Backtracking
Seunghwan Min, Jihoon Jang, Kunsoo Park +3
Real-time analysis of graphs containing temporal information, such as social media streams, Q&A networks, and cyber data sources, plays an important role in various applications. A…
Hypercubes and Isometric Words based on Swap and Mismatch Distance
Marcella Anselmo, Giuseppa Castiglione, Manuela Flores +3
The hypercube of dimension n is the graph whose vertices are the 2^n binary words of length n, and there is an edge between two of them if they have Hamming distance 1. We consider…
Isometric Words based on Swap and Mismatch Distance
Marcella Anselmo, Giuseppa Castiglione, Manuela Flores +3
An edit distance is a metric between words that quantifies how two words differ by counting the number of edit operations needed to transform one word into the other one. A word f…