Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q7502165> ?p ?o }
Showing triples 1 to 12 of
12
with 100 triples per page.
- Q7502165 subject Q7035728.
- Q7502165 subject Q7481159.
- Q7502165 abstract "In computer science, the shortest total path length spanning tree is, given an n-node undirected graph G(V, E); positive integer B, does there exist a spanning tree T(V, F) of G such that the sum over all pairs of nodes u and v of the length of the path between u and v in T is no greater than B?".
- Q7502165 wikiPageWikiLink Q21198.
- Q7502165 wikiPageWikiLink Q6830528.
- Q7502165 wikiPageWikiLink Q7035728.
- Q7502165 wikiPageWikiLink Q7481159.
- Q7502165 wikiPageWikiLink Q831672.
- Q7502165 wikiPageWikiLink Q92801.
- Q7502165 wikiPageWikiLink Q938821.
- Q7502165 comment "In computer science, the shortest total path length spanning tree is, given an n-node undirected graph G(V, E); positive integer B, does there exist a spanning tree T(V, F) of G such that the sum over all pairs of nodes u and v of the length of the path between u and v in T is no greater than B?".
- Q7502165 label "Shortest total path length spanning tree".