Schema Matching Based on Labeled Graph

2009 ◽  
Author(s):  
Guitao Cao ◽  
Zhi Zhang
Keyword(s):  
Schema Matching ◽  
Labeled Graph

T Wiener Index of Fibonacci Labeled Graph Pn ʘ F4

2018 ◽  
Vol 9 (11) ◽  
pp. 1712-1716
Author(s):  
R. Palanikumar ◽  
A. Rameshkumar
Keyword(s):  
Wiener Index ◽  
Labeled Graph

Ontology-Aided Automatic Schema Matching

2009 ◽  
Vol 20 (2) ◽  
pp. 234-245 ◽  
Author(s):  
Qiang LIU ◽  
Di ZHAO ◽  
Hua ZHONG ◽  
Tao HUANG
Keyword(s):  
Schema Matching

Reconstructing a Graph from its Neighborhood Lists

1993 ◽  
Vol 2 (2) ◽  
pp. 103-113 ◽  
Author(s):  
Martin Aigner ◽  
Eberhard Triesch
Keyword(s):  
Decision Problem ◽  
Graph Isomorphism ◽  
Bipartite Graphs ◽  
Labeled Graph ◽  
Np Complete

Associate to a finite labeled graph G(V, E) its multiset of neighborhoods (G) = {N(υ): υ ∈ V}. We discuss the question of when a list is realizable by a graph, and to what extent G is determined by (G). The main results are: the decision problem is NP-complete; for bipartite graphs the decision problem is polynomially equivalent to Graph Isomorphism; forests G are determined up to isomorphism by (G); and if G is connected bipartite and (H) = (G), then H is completely described.

Database Conceptual Schema Matching

Computer ◽  
2007 ◽  
Vol 40 (10) ◽  
pp. 102-104 ◽  
Author(s):  
Marco A. Casanova ◽  
Karin K. Breitman ◽  
Daniela F. Brauner ◽  
André L.A. Marins
Keyword(s):  
Schema Matching ◽  
Conceptual Schema
Sign in / Sign up

Export Citation Format

Share Document