A graph is a pair G=(V,E), where V is a set, called the set of vertices of the graph G, and E is a set of unordered pairs of vertices, called the edges of the graph G. A directed graph (or digraph) is a pair D=(V,E), where V is a set, called the set of vertices of the digraph D, and E is a set of ordered pairs of vertices, called arcs of the digraph D.
KeywordsConnected Graph Edit Distance Editing Operation Block Graph Common Subgraph
- [AAH00]Aichholzer O., Aurenhammer F. and Hurtado F. Edge Operations on Non-crossing Spanning Trees, in Proc. 16th European Workshop on Computational Geometry CG’2000, pp. 121–125, 2000. Google Scholar