A challenge for semantic query wizzards: Find the smallest connected graph having at least a node in each LOD data set
Interesting. The hardest part might be finding paths through the FOAF bubble.
Any takers?
A challenge for semantic query wizzards: Find the smallest connected graph having at least a node in each LOD data set
Interesting. The hardest part might be finding paths through the FOAF bubble.
Any takers?