LIVE learns monotonic vertex embeddings using a differentiable surrogate objective and a lightweight iLabel index to outperform prior methods in efficiency and pruning for exact subgraph matching.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DB 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
LIVE: Learnable Monotonic Vertex Embedding for Efficient Exact Subgraph Matching (Technical Report)
LIVE learns monotonic vertex embeddings using a differentiable surrogate objective and a lightweight iLabel index to outperform prior methods in efficiency and pruning for exact subgraph matching.