The Graph of Time Delay between EF and MF vs. Distance
An edit distance between graph correspondences.
... error-tolerant graph matching. Several graph matching methods have been proposed in recent years [ 1 – 3 ] and therefore, it is possible to generate more than one correspondence between a single pair ...
10
Graph edit distance or graph edit pseudo-distance?
... the Graph Edit Distance to be directly related to the maximal common sub- ...the Graph Edit Distance is exactly the same than deducting the maximal common ...distances between vectors ...
7
Inequalities between degree and distance based graph invariants
... where d G ≥ 2, and the equality does not hold because if G ∼ = K n for n ≥ 4, then d G = 1. After simplification, we get the desired result. 4 Conclusion In this paper, some inequality relations have been studied ...
15
The graph distance game and some graph operations
... terrelationship between this games and some operations in graphs ...the graph distance game is introduced as follows. Given a graph G, two players alternate in constructing a ...final ...
6
Hamming distance between the strings generated by adjacency matrix of a graph and their sum
... interesting graph family in connec- tion with the error-correcting codes and association ...Hamming distance between the strings generated by the adjacency matrix of a ...distances between all ...
12
The influence of a time delay between sequential tunnel constructions
... The current research programme is to explore the ground movements in overconsolidated clay when constructing parallel tunnels with a small separation distance. The current tests represent circumstances under which ...
7
Distance-Preserving Graph Contractions
... The distance dist ` (u, v) between two vertices u and v is the length of a shortest path between u and v in G with respect to ...simple graph obtained from G by contracting the edges in C, ...
14
Bayesian graph edit distance
... dictionary-based graph- matching technique requires a polynomial number of dictionary comparisons, relatively little attention has been paid to the time and space complexity of dictionary compilation and ...
9
Distance Closed Domination in Graph
... of distance closed set is defined and studied in the doctoral thesis of Janakiraman [9] and the concept of distance closed sets in graph theory is due to the related concept of ideals in ring theory ...
9
Convex graph invariant relaxations for graph edit distance
... pairwise graph edit distance for this dataset can be calculated exactly using combinatorial algorithms such as the A ∗ procedure ...bond between the corresponding ...smallest graph in PAH has ...
27
Distance, Dependencies, and Delay in a Global Collaboration
... over distance must contend with the loss of the rich, subtle interactions that co-located teams use to coordinate their ...of delay in a multi-site software development ...to delay. Our results show ...
10
RELATIVE TIME DELAY AND ABSOLUTE TIME DELAY. Kexin Yao
... However, it can be seen from further analysis that, the black hole is unlikely to be a kind of real substance. There are two main reasons: As explained above, the gravitational mass of an object is unrelated to the ...
13
A Graph Theoretic Framework for Semantic Distance
... the distance between concepts as embedded in a graph (the ontology), not just between concept ...the distance of that text from ...similarity between texts that use related but ...
40
Bounds for the Generalized Distance Eigenvalues of a Graph
... (simple) graph is denoted by G = ( V ( G ) , E ( G )) , where V ( G ) = { v 1 , v 2 , ...regular graph, all its vertices have the same degree. Let d uv be the distance between two vertices u, ...
18
Distance Neighbourhood Pattern Matrices in a Graph
... ACKNOWLEDGEMENTS Authors deeply indebted to B.D. Acharya for suggesting the con- cept of dnp-matrices of a dpd-graph and sparing his valuable time in sharing his many incisive thoughts to propel our ...
17
Distance Closed Restrained Domination in Graph
... One important aspect of the concept of distance and eccentricity is the existence of polynomial time algorithm to analyze them. The concept of domination in graphs originated from the chess games theory and ...
9
The Reeb Graph Edit Distance Is Universal
... distances between them that are stable, meaning that functions which are similar in the supremum norm ought to have similar Reeb ...edit distance for Reeb graphs and prove that it is stable and universal, ...
16
A Comparison of Floating Car vs. Loop Detector Estimated Freeway Travel Time Delay
... Relationships between the two types of methods in delay ...78% between loop detector and floating car ...the delay information obtained by different methods should not be directly summed ...
23
Polynomial-Delay Enumeration of Monotonic Graph Classes
... polynomial delay. Classes of graphs that can be enumerated with low run-time complexity are connected graphs, planar graphs, minor closed graphs, mono- tonic classes of graphs in general, and hereditary ...
23
Delay time modelling
... interaction between inspection and equipment performance may be captured using the delay time concept presented ...The time history of breakdown or failure events is a random series of points, ...
29