The following pages link to On the editing distance of graphs (Q3506314):
Displaying 18 items.
- The edit distance function and symmetrization (Q396842) (← 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)
- Editing to prime graphs (Q2049029) (← links)
- The edit distance function of some graphs (Q2175239) (← links)
- Differential calculus on the space of countable labelled graphs (Q2216821) (← links)
- \((k,l)\)-colourings and Ferrers diagram representations of cographs (Q2225413) (← 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 K2,t-Free Graphs (Q2922222) (← links)
- A note on the bichromatic numbers of graphs (Q3061187) (← links)
- Partitioning a Graph into Highly Connected Subgraphs (Q3188667) (← links)
- Edit distance measure for graphs (Q3466188) (← links)
- A Brooks‐Type Theorem for the Bichromatic Number (Q3466343) (← links)
- Stability‐type results for hereditary properties (Q3652542) (← links)
- Sparse graphs: Metrics and random models (Q5198669) (← links)
- The regularity of almost all edge ideals (Q6187710) (← links)
