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

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

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n8http://dbpedia.org/resource/File:
n7https://global.dbpedia.org/id/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
n14http://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/
dbphttp://dbpedia.org/property/
provhttp://www.w3.org/ns/prov#
dbchttp://dbpedia.org/resource/Category:
xsdhhttp://www.w3.org/2001/XMLSchema#
wikidatahttp://www.wikidata.org/entity/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Garsia-Wachs_algorithm
dbo:wikiPageWikiLink
dbr:Garsia–Wachs_algorithm
dbo:wikiPageRedirects
dbr:Garsia–Wachs_algorithm
Subject Item
dbr:Optimal_binary_search_tree
dbo:wikiPageWikiLink
dbr:Garsia–Wachs_algorithm
Subject Item
dbr:Garsia–Wachs_algorithm
rdfs:label
Garsia–Wachs algorithm
rdfs:comment
The Garsia–Wachs algorithm is an efficient method for computers to construct optimal binary search trees and alphabetic Huffman codes, in linearithmic time. It is named after Adriano Garsia and Michelle L. Wachs.
foaf:depiction
n14:Garsia–Wachs_algorithm.svg
dcterms:subject
dbc:Binary_trees dbc:Combinatorial_algorithms dbc:Search_trees dbc:Lossless_compression_algorithms
dbo:wikiPageID
58863156
dbo:wikiPageRevisionID
1032247869
dbo:wikiPageWikiLink
dbr:Bit dbr:Data_compression dbr:Adriano_Garsia dbr:Sentinel_value n8:Garsia–Wachs_algorithm.svg dbr:Huffman_code dbr:Binary_search_tree dbr:Binary_search dbr:Linearithmic dbc:Binary_trees dbr:Binary_tree dbc:Search_trees dbc:Combinatorial_algorithms dbr:Self-balancing_binary_search_tree dbr:Michelle_L._Wachs dbr:Optimal_binary_search_tree dbr:Expected_time dbr:Alan_Tucker dbc:Lossless_compression_algorithms dbr:Sequential_search dbr:Huffman_coding
owl:sameAs
n7:9LgTg wikidata:Q60791212
dbp:wikiPageUsesTemplate
dbt:Citation dbt:Reflist dbt:R dbt:Harvtxt
dbo:thumbnail
n14:Garsia–Wachs_algorithm.svg?width=300
dbo:abstract
The Garsia–Wachs algorithm is an efficient method for computers to construct optimal binary search trees and alphabetic Huffman codes, in linearithmic time. It is named after Adriano Garsia and Michelle L. Wachs.
prov:wasDerivedFrom
wikipedia-en:Garsia–Wachs_algorithm?oldid=1032247869&ns=0
dbo:wikiPageLength
9395
foaf:isPrimaryTopicOf
wikipedia-en:Garsia–Wachs_algorithm
Subject Item
dbr:Adriano_Garsia
dbo:wikiPageWikiLink
dbr:Garsia–Wachs_algorithm
Subject Item
dbr:Huffman_coding
dbo:wikiPageWikiLink
dbr:Garsia–Wachs_algorithm
Subject Item
dbr:Michelle_L._Wachs
dbo:wikiPageWikiLink
dbr:Garsia–Wachs_algorithm
Subject Item
wikipedia-en:Garsia–Wachs_algorithm
foaf:primaryTopic
dbr:Garsia–Wachs_algorithm