A challenge for semantic query wizards

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?

This entry was posted in General, Semantic Web. Bookmark the permalink.