Graphs and matching techniques are a well-studied topic. In this paper, we individuate a sub-class of graphs, which we call semantic graphs, characterized by labels whose meaning is independent from their occurrence in graph. We show how this changes the meaning of graph nodes and, consequently, the matching problem. Finally, we propose an algorithm for matching semantic graphs

Matching Semantic Graphs

Serafini, Luciano;
2005-01-01

Abstract

Graphs and matching techniques are a well-studied topic. In this paper, we individuate a sub-class of graphs, which we call semantic graphs, characterized by labels whose meaning is independent from their occurrence in graph. We show how this changes the meaning of graph nodes and, consequently, the matching problem. Finally, we propose an algorithm for matching semantic graphs
2005
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11582/2611
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
social impact