Pages that link to "Item:Q2957174"
From MaRDI portal
The following pages link to The edit distance in graphs: Methods, results, and generalizations (Q2957174):
Displaying 12 items.
- Obstructions for partitioning into forests and outerplanar graphs (Q831856) (← links)
- A local branching heuristic for solving a graph edit distance problem (Q1734846) (← links)
- Accumulation points of the edit distance function (Q2138953) (← links)
- The edit distance function of some graphs (Q2175239) (← links)
- On the edit distance of powers of cycles (Q2317648) (← links)
- Deviation estimates for Eulerian edit numbers of random graphs (Q2658005) (← links)
- (Q4450795) (← links)
- ON THE EDITING DISTANCE BETWEEN UNDIRECTED ACYCLIC GRAPHS (Q4888367) (← links)
- Edit Distance and Persistence Diagrams over Lattices (Q5073708) (← links)
- Improved Graph Edit Distance Approximation with Simulated Annealing (Q5082159) (← links)
- (Q5398399) (← links)
- On the edit distance function of the random graph (Q5886325) (← links)