This HTML5 document contains 57 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
n11https://svn.boost.org/trac/boost/ticket/
dctermshttp://purl.org/dc/terms/
yago-reshttp://yago-knowledge.org/resource/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n17http://dbpedia.org/resource/File:
n6https://global.dbpedia.org/id/
yagohttp://dbpedia.org/class/yago/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
n10http://thinkingscale.com/k-shortest-paths-cpp-version/
freebasehttp://rdf.freebase.com/ns/
dbpedia-srhttp://sr.dbpedia.org/resource/
n12http://commons.wikimedia.org/wiki/Special:FilePath/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
wikipedia-enhttp://en.wikipedia.org/wiki/
dbchttp://dbpedia.org/resource/Category:
dbphttp://dbpedia.org/property/
provhttp://www.w3.org/ns/prov#
xsdhhttp://www.w3.org/2001/XMLSchema#
wikidatahttp://www.wikidata.org/entity/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Optical_mesh_network
dbo:wikiPageWikiLink
dbr:Yen's_algorithm
Subject Item
dbr:K_shortest_path_routing
dbo:wikiPageWikiLink
dbr:Yen's_algorithm
Subject Item
dbr:Routing_and_wavelength_assignment
dbo:wikiPageWikiLink
dbr:Yen's_algorithm
Subject Item
dbr:Yen's_algorithm
rdf:type
yago:Act100030358 yago:Abstraction100002137 yago:Attribute100024264 yago:PsychologicalFeature100023100 yago:Rule105846932 yago:State100024720 yago:WikicatPolynomial-timeProblems yago:Activity100407535 yago:Event100029378 yago:Procedure101023820 yago:WikicatGraphAlgorithms yago:Algorithm105847438 yago:Difficulty114408086 yago:Problem114410605 yago:Condition113920835 yago:YagoPermanentlyLocatedEntity
rdfs:label
Yen's algorithm
rdfs:comment
Yen's algorithm computes single-source K-shortest loopless paths for a graph with non-negative edge cost. The algorithm was published by Jin Y. Yen in 1971 and employs any shortest path algorithm to find the best path, then proceeds to find K − 1 deviations of the best path.
foaf:depiction
n12:3,_A_to_F.gif
dcterms:subject
dbc:Articles_with_example_pseudocode dbc:Graph_algorithms dbc:Polynomial-time_problems
dbo:wikiPageID
37865256
dbo:wikiPageRevisionID
1076312899
dbo:wikiPageWikiLink
dbc:Polynomial-time_problems dbr:Shortest_path_algorithm dbr:Bellman–Ford_algorithm dbr:K_shortest_path_routing dbr:Graph_(discrete_mathematics) dbr:Shortest_path dbr:Dijkstra_algorithm dbr:Glossary_of_graph_theory dbr:Eugene_Lawler dbc:Articles_with_example_pseudocode n17:Yen's_K-Shortest_Path_Algorithm,_K=3,_A_to_F.gif dbr:Dijkstra's_algorithm dbc:Graph_algorithms
dbo:wikiPageExternalLink
n10: n11:11838
owl:sameAs
n6:4x9Ca dbpedia-sr:Јенов_алогритам freebase:m.0p3qtqp wikidata:Q8052172 yago-res:Yen's_algorithm
dbp:wikiPageUsesTemplate
dbt:Tree_search_algorithm dbt:Reflist
dbo:thumbnail
n12:3,_A_to_F.gif?width=300
dbo:abstract
Yen's algorithm computes single-source K-shortest loopless paths for a graph with non-negative edge cost. The algorithm was published by Jin Y. Yen in 1971 and employs any shortest path algorithm to find the best path, then proceeds to find K − 1 deviations of the best path.
prov:wasDerivedFrom
wikipedia-en:Yen's_algorithm?oldid=1076312899&ns=0
dbo:wikiPageLength
15102
foaf:isPrimaryTopicOf
wikipedia-en:Yen's_algorithm
Subject Item
dbr:Yen's_Algorithm
dbo:wikiPageWikiLink
dbr:Yen's_algorithm
dbo:wikiPageRedirects
dbr:Yen's_algorithm
Subject Item
wikipedia-en:Yen's_algorithm
foaf:primaryTopic
dbr:Yen's_algorithm