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
- 2. Xianrui Meng
- 3. George Kollios
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 |
|---|---|---|---|---|
| 768 | PathSim: Meta Path-Based Top-K Similarity Search in Heterogeneous Information Networks | 2011 | VLDB | 0.00016919065 |
| 917 | Simrank++: Query Rewriting through Link Analysis of the Click Graph | 2008 | VLDB | 0.00015370124 |
| 951 | Comparing Stars: On Approximating Graph Edit Distance | 2009 | VLDB | 0.00015106325 |
| 1,285 | Neighborhood Based Fast Graph Search in Large Networks | 2011 | SIGMOD | 0.00012833377 |
| 1,903 | More is Simpler: Effectively and Efficiently Assessing Node-Pair Similarities Based on Hyperlinks | 2014 | VLDB | 0.00010155777 |
| 2,551 | NeMa: Fast Graph Search with Label Similarity | 2013 | VLDB | 8.5572574e-05 |
| 3,301 | RTED: A Robust Algorithm for the Tree Edit Distance | 2012 | VLDB | 7.2515266e-05 |
Previous
Page 1 / 1
Next