Pages that link to "Item:Q3682519"
From MaRDI portal
The following pages link to Edge rotations and distance between graphs (Q3682519):
Displaying 14 items.
- Approximating degree sequences with regular graphic sequences (extended abstract) (Q283722) (← links)
- Measuring closeness of graphs -- the Hausdorff distance (Q506185) (← links)
- Planar graphs and greatest common subgraphs (Q687720) (← links)
- Greatest common subgroups with specified properties (Q1119602) (← links)
- Two metrics in a graph theory modeling of organic chemistry (Q1183341) (← links)
- On the rotation distance of graphs (Q1318800) (← links)
- Distances between graphs under edge operations (Q1356416) (← links)
- Subgraph distances in graphs defined by edge transfers (Q1363654) (← links)
- Edge rotation and edge slide distance graphs (Q1388979) (← links)
- Fifty years of graph matching, network alignment and network comparison (Q1991876) (← links)
- Degree-anonymization using edge rotations (Q2034394) (← links)
- Model-free two-sample test for network-valued data (Q2291338) (← links)
- Graphic sequences, distances and \(k\)-degree anonymity (Q2345626) (← links)
- Determining the Hausdorff Distance Between Trees in Polynomial Time (Q5024666) (← links)
