Name
Abstract | ||
|---|---|---|
This work presents a new algorithm to detect RDF graph isomorphism. Furthermore, we show that isomorphic RDF graphs issue can be solved in an efficient manner using graphs information. Algorithm efficiency resides in the detection of RDF subgraphs isomorphism. The theoretical complexity of algorithm is O(nlogn+ eG), where n is the number of vertices and eG is the cost to check all edges. The proposed algorithm was compared with Iterative Vertex Classification algorithm in order to show the strengths of the new algorithm, called LPS (Longest Path Subgraph). Experimental tests show a much better performance of LPS algorithm. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1109/ENC.2008.41 | ENC |
Keywords | Field | DocType |
graphs information,efficient algorithm,isomorphic rdf graphs issue,longest path subgraph,new algorithm,match rdf graphs,rdf subgraphs isomorphism,lps algorithm,proposed algorithm,rdf graph isomorphism,iterative vertex classification algorithm,algorithm efficiency resides,algorithms,xml,algorithm design and analysis,semantic web,cost function,longest path,graph theory,data models,classification algorithms,graph isomorphism,computational complexity,meta data | Algorithm design,Graph isomorphism,Computer science,Algorithm,Induced subgraph isomorphism problem,Theoretical computer science,Hopcroft–Karp algorithm,Suurballe's algorithm,Shortest Path Faster Algorithm,Longest path problem,Subgraph isomorphism problem | Conference |
Citations | PageRank | References |
0 | 0.34 | 6 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Claudio Gutiérrez-Soto | 1 | 1 | 2.04 |
| Pedro G. Campos | 2 | 146 | 8.92 |
| Julio Águila | 3 | 0 | 0.34 |