The following pages link to Edit distance and its computation (Q1010726):
Displaying 27 items.
- Multicolor and directed edit distance (Q357457) (← links)
- The edit distance function and symmetrization (Q396842) (← links)
- Induced saturation number (Q456647) (← links)
- On the computation of edit distance functions (Q472982) (← links)
- The structure of hereditary properties and 2-coloured multigraphs (Q653987) (← links)
- Graph distance measures based on topological indices revisited (Q669403) (← links)
- A dynamic edit distance table (Q876720) (← links)
- The maximum edit distance from hereditary graph properties (Q933672) (← links)
- Classes of cost functions for string edit distance (Q1355732) (← links)
- Computation of edit probabilities and edit distances for the A5-type keystream generator (Q1599209) (← links)
- Edit distance with block deletions (Q1736478) (← links)
- Accumulation points of the edit distance function (Q2138953) (← links)
- On a colored Turán problem of Diwan and Mubayi (Q2144601) (← links)
- The edit distance function of some graphs (Q2175239) (← links)
- A comparative analysis of new graph distance measures and graph edit distance (Q2293189) (← links)
- On the edit distance of powers of cycles (Q2317648) (← links)
- On the edit distance from \(K_{2,t}\)-free graphs (Q2922222) (← links)
- Edit Distance to Monotonicity in Sliding Windows (Q3104657) (← links)
- Edit distance measure for graphs (Q3466188) (← links)
- On the editing distance of graphs (Q3506314) (← links)
- What is the furthest graph from a hereditary property? (Q3522831) (← links)
- Stability‐type results for hereditary properties (Q3652542) (← links)
- (Q4536497) (← links)
- Distinguishing Local and Global Edits for Their Simultaneous Propagation in a Uniform Framework (Q4612918) (← links)
- (Q5002705) (← links)
- On the edit distance function of the random graph (Q5886325) (← links)
- The regularity of almost all edge ideals (Q6187710) (← links)
