NED: An Inter-Graph Node Metric Based On Edit Distance
Summary: NED measures inter-graph node similarity from local unordered k-neighborhoods. TED* provides a poly-time, metric distance for unordered/unlabeled trees, enabling efficient indexing and transfer-learning in inter-graph analysis, with empirical validation. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Haohan Zhu (Meta)
- 2. Xianrui Meng (Apple)
- 3. George Kollios (Boston University)
BibTeX Citation
@article{zhu_vldb17,
title = {{NED: An Inter-Graph Node Metric Based On Edit Distance}},
author = {Zhu, Haohan and Meng, Xianrui and Kollios, George},
journal = {PVLDB},
series = {{VLDB} '17},
volume = {10},
number = {6},
doi = {10.14778/3055330.3055336},
url = {https://doi.org/10.14778/3055330.3055336},
year = {2017}
}Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 7 of 7 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 731 | PathSim: Meta Path-Based Top-K Similarity Search in Heterogeneous Information Networks | 2011 | VLDB | 0.00014537965 |
| 758 | Simrank++: Query Rewriting through Link Analysis of the Click Graph | 2008 | VLDB | 0.00014277369 |
| 1,115 | Comparing Stars: On Approximating Graph Edit Distance | 2009 | VLDB | 0.00012117375 |
| 1,394 | Neighborhood Based Fast Graph Search in Large Networks | 2011 | SIGMOD | 0.0001093153 |
| 1,588 | More is Simpler: Effectively and Efficiently Assessing Node-Pair Similarities Based on Hyperlinks | 2014 | VLDB | 0.0001026895 |
| 2,285 | NeMa: Fast Graph Search with Label Similarity | 2013 | VLDB | 8.8052998e-05 |
| 3,165 | RTED: A Robust Algorithm for the Tree Edit Distance | 2012 | VLDB | 7.6759052e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 370 | TEDI: Efficient Shortest Path Query Answering on Graphs | 2010 | SIGMOD |
| 2 | 1,115 | Comparing Stars: On Approximating Graph Edit Distance | 2009 | VLDB |
| 3 | 7,152 | Boosting Graph Similarity Search through Pre-Computation | 2021 | SIGMOD |
| 4 | 10,939 | Fused Gromov-Wasserstein Alignment for Graph Edit Distance Computation and Beyond | 2025 | VLDB |
| 5 | 3,047 | Similarity Evaluation on Tree-structured Data | 2005 | SIGMOD |
| 6 | 10,524 | A Semantics-aware Approach for Graph Edit Distance Estimation over Knowledge Graphs | 2026 | VLDB |
| 7 | 3,933 | TaGSim: Type-aware Graph Similarity Learning and Computation | 2022 | VLDB |
| 8 | 8,126 | Computing Approximate Graph Edit Distance via Optimal Transport | 2025 | SIGMOD |
| 9 | 10,764 | Graph Edit Distance Estimation: A New Heuristic and A Holistic Evaluation of Learning-based Methods | 2025 | SIGMOD |
| 10 | 3,423 | Computing Graph Edit Distance via Neural Graph Matching | 2023 | VLDB |