𝔖 Bobbio Scriptorium
✦   LIBER   ✦

ON THE GRAPH EDIT DISTANCE COST: PROPERTIES AND APPLICATIONS

✍ Scribed by SOLÉ-RIBALTA, ALBERT; SERRATOSA, FRANCESC; SANFELIU, ALBERTO

Book ID
119995477
Publisher
World Scientific Publishing Company
Year
2012
Tongue
English
Weight
496 KB
Volume
26
Category
Article
ISSN
0218-0014

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the editing distance of graphs
On the editing distance of graphs
✍ Maria Axenovich; André Kézdy; Ryan Martin 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 169 KB 👁 2 views

## Abstract An edge‐operation on a graph __G__ is defined to be either the deletion of an existing edge or the addition of a nonexisting edge. Given a family of graphs $\cal G$, the editing distance from __G__ to $\cal G$ is the smallest number of edge‐operations needed to modify __G__ into a graph

On the average Steiner distance of graph
On the average Steiner distance of graphs with prescribed properties
✍ Peter Dankelmann; Henda C. Swart; Ortrud R. Oellermann 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 703 KB

The average n-distance of a connected graph G, p,,(G), is the average of the Steiner distances of all n-sets of vertices of G. In this paper, we give bounds on pn for two-connected graphs and for k-chromatic graphs. Moreover, we show that pn(G) does not depend on the n-diameter of G.