dowhatimean.net

Bernard Vatant:

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 on Tuesday, November 13th, 2007 at 3:17 pm and is filed under General, Semantic Web. You can follow any responses to this entry through the RSS 2.0 feed. You can leave a response, or trackback from your own site.