Browse using
OpenLink Faceted Browser
OpenLink Structured Data Editor
LodLive Browser
Formats
RDF:
N-Triples
N3
Turtle
JSON
XML
OData:
Atom
JSON
Microdata:
JSON
HTML
Embedded:
JSON
Turtle
Other:
CSV
JSON-LD
Faceted Browser
Sparql Endpoint
About:
Routing algorithms
An Entity of Type:
Concept
,
from Named Graph:
http://dbpedia.org
,
within Data Space:
dbpedia.org
Property
Value
dbo:
wikiPageID
1882018
(xsd:integer)
dbo:
wikiPageRevisionID
739439315
(xsd:integer)
rdf:
type
skos
:Concept
rdfs:
label
Routing algorithms
(en)
skos:
broader
dbc
:Routing
dbc
:Networking_algorithms
dbc
:Algorithms
skos:
prefLabel
Routing algorithms
(en)
prov:
wasDerivedFrom
wikipedia-en
:Category:Routing_algorithms?oldid=739439315&ns=14
is
dbo:
wikiPageWikiLink
of
dbr
:MENTOR_routing_algorithm
dbr
:Multipath_routing
dbr
:Arc_routing
dbr
:Pathfinding
dbr
:ODMRP
dbr
:Wavefront_expansion_algorithm
dbr
:Geographic_routing
dbr
:Contraction_hierarchies
dbr
:Credit-based_fair_queuing
dbr
:Theta*
dbr
:Equal-cost_multi-path_routing
dbr
:Optimization_mechanism
dbr
:Optimized_Link_State_Routing_Protocol
dbr
:Max-min_fairness
dbr
:Link-state_routing_protocol
dbr
:Source_routing
dbr
:Temporally_ordered_routing_algorithm
dbr
:A*_search_algorithm
dbr
:Diffusing_update_algorithm
dbr
:Fairness_measure
dbr
:Flood_search_routing
dbr
:Flooding_(computer_networking)
dbr
:Floyd–Warshall_algorithm
dbr
:Iterative_deepening_A*
dbr
:Route_redistribution
dbr
:Babel_(protocol)
dbr
:Backpressure_routing
dbr
:Suurballe's_algorithm
dbr
:Edge_disjoint_shortest_pair_algorithm
dbr
:Hierarchical_state_routing
dbr
:Dijkstra's_algorithm
dbr
:Distance-vector_routing_protocol
dbr
:Augmented_tree-based_routing
dbr
:B*
dbr
:Greedy_embedding
dbr
:SMA*
dbr
:Vehicular_Reactive_Routing_protocol
dbr
:Wireless_Routing_Protocol
dbr
:Expected_transmission_count
dbr
:Luleå_algorithm
dbr
:Transit_node_routing
dbr
:Segment_routing
is
dcterms:
subject
of
dbr
:MENTOR_routing_algorithm
dbr
:Multipath_routing
dbr
:Arc_routing
dbr
:Pathfinding
dbr
:ODMRP
dbr
:Wavefront_expansion_algorithm
dbr
:Geographic_routing
dbr
:Contraction_hierarchies
dbr
:Credit-based_fair_queuing
dbr
:Theta*
dbr
:Equal-cost_multi-path_routing
dbr
:Optimization_mechanism
dbr
:Optimized_Link_State_Routing_Protocol
dbr
:Max-min_fairness
dbr
:Link-state_routing_protocol
dbr
:Source_routing
dbr
:Temporally_ordered_routing_algorithm
dbr
:A*_search_algorithm
dbr
:Diffusing_update_algorithm
dbr
:Fairness_measure
dbr
:Flood_search_routing
dbr
:Flooding_(computer_networking)
dbr
:Floyd–Warshall_algorithm
dbr
:Iterative_deepening_A*
dbr
:Route_redistribution
dbr
:Babel_(protocol)
dbr
:Backpressure_routing
dbr
:Suurballe's_algorithm
dbr
:Edge_disjoint_shortest_pair_algorithm
dbr
:Hierarchical_state_routing
dbr
:Dijkstra's_algorithm
dbr
:Distance-vector_routing_protocol
dbr
:Augmented_tree-based_routing
dbr
:B*
dbr
:Greedy_embedding
dbr
:SMA*
dbr
:Vehicular_Reactive_Routing_protocol
dbr
:Wireless_Routing_Protocol
dbr
:Expected_transmission_count
dbr
:Luleå_algorithm
dbr
:Transit_node_routing
dbr
:Segment_routing
is
skos:
broader
of
dbc
:Flooding_algorithms
This content was extracted from
Wikipedia
and is licensed under the
Creative Commons Attribution-ShareAlike 3.0 Unported License