Graph Isomorphism Algorithms - Daniel Baggenstos
-30% ar kodu BOOKS
Piegāde 10-16 darba dienu laikā
30 dienu atgriešanas politika
This thesis introduces similarity measures to be used by comparing XML workflows and RDF or OWL structures. These structures are accessed and converted into a generic graph representation. Two graphs are compared by a measure to conclude in a single value indicating the similarity of the graphs. Similarity is calculated by two different similarity measures, the graph isomorphism measure and the subgraph iso ... Pilns apraksts
Jums varētu patikt arī
Aprašymas
Vairāk informācijas
| Autors | Daniel Baggenstos |
|---|---|
| Izdevējs | KS Omniscriptum Publishing |
| Izlaides gads | 2008 |
| Vāka tips | Mīkstais vāks |
| EAN | 9783836469456 |