Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/Shortest_total_path_length_spanning_tree> ?p ?o }
Showing triples 1 to 26 of
26
with 100 triples per page.
- Shortest_total_path_length_spanning_tree 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?".
- Shortest_total_path_length_spanning_tree wikiPageID "31277685".
- Shortest_total_path_length_spanning_tree wikiPageLength "739".
- Shortest_total_path_length_spanning_tree wikiPageOutDegree "7".
- Shortest_total_path_length_spanning_tree wikiPageRevisionID "695748755".
- Shortest_total_path_length_spanning_tree wikiPageWikiLink Category:NP-complete_problems.
- Shortest_total_path_length_spanning_tree wikiPageWikiLink Category:Spanning_tree.
- Shortest_total_path_length_spanning_tree wikiPageWikiLink Computer_science.
- Shortest_total_path_length_spanning_tree wikiPageWikiLink Computers_and_Intractability.
- Shortest_total_path_length_spanning_tree wikiPageWikiLink David_S._Johnson.
- Shortest_total_path_length_spanning_tree wikiPageWikiLink Michael_Garey.
- Shortest_total_path_length_spanning_tree wikiPageWikiLink Spanning_tree.
- Shortest_total_path_length_spanning_tree wikiPageWikiLinkText "Shortest total path length spanning tree".
- Shortest_total_path_length_spanning_tree wikiPageUsesTemplate Template:Cite_book.
- Shortest_total_path_length_spanning_tree wikiPageUsesTemplate Template:Comp-sci-stub.
- Shortest_total_path_length_spanning_tree wikiPageUsesTemplate Template:Notability.
- Shortest_total_path_length_spanning_tree subject Category:NP-complete_problems.
- Shortest_total_path_length_spanning_tree subject Category:Spanning_tree.
- Shortest_total_path_length_spanning_tree type Algorithm.
- Shortest_total_path_length_spanning_tree 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?".
- Shortest_total_path_length_spanning_tree label "Shortest total path length spanning tree".
- Shortest_total_path_length_spanning_tree sameAs Q7502165.
- Shortest_total_path_length_spanning_tree sameAs m.08m9__.
- Shortest_total_path_length_spanning_tree sameAs Q7502165.
- Shortest_total_path_length_spanning_tree wasDerivedFrom Shortest_total_path_length_spanning_tree?oldid=695748755.
- Shortest_total_path_length_spanning_tree isPrimaryTopicOf Shortest_total_path_length_spanning_tree.