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

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

PrefixNamespace IRI
n22http://dbpedia.org/resource/Birkhoff_decomposition_(disambiguation)
n19http://dbpedia.org/resource/Birkhoff_algorithm#
dcthttp://purl.org/dc/terms/
n20http://dbpedia.org/resource/Birkhoff'
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n9http://dbpedia.org/resource/Gordan'
n21https://global.dbpedia.org/id/
wdrshttp://www.w3.org/2007/05/powder-s#
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
n14http://en.wikipedia.org/wiki/Birkhoff_algorithm?oldid=1112396551&ns=
n8https://covidontheweb.inria.fr:4443/about/id/entity/http/dbpedia.org/resource/Category:
n12https://covidontheweb.inria.fr:4443/about/id/entity/http/dbpedia.org/resource/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
wikipedia-enhttp://en.wikipedia.org/wiki/
provhttp://www.w3.org/ns/prov#
dbchttp://dbpedia.org/resource/Category:
dbphttp://dbpedia.org/property/
xsdhhttp://www.w3.org/2001/XMLSchema#
wdhttp://www.wikidata.org/entity/
dbrhttp://dbpedia.org/resource/
Subject Item
dbr:Birkhoff_algorithm
rdfs:label
Birkhoff algorithm
rdfs:comment
Birkhoff's algorithm (also called Birkhoff-von-Neumann algorithm) is an algorithm for decomposing a bistochastic matrix into a convex combination of permutation matrices. It was published by Garrett Birkhoff in 1946. It has many applications. One such application is for the problem of fair random assignment: given a randomized allocation of items, Birkhoff's algorithm can decompose it into a lottery on deterministic allocations.
owl:sameAs
wd:Q98079213 dbr:Birkhoff_algorithm n21:FSYFr
foaf:topic
dbr:List_of_things_named_after_John_von_Neumann dbr:Fair_random_assignment n9:s_lemma dbr:Garrett_Birkhoff dbr:Birkhoff_polytope dbr:Birkhoff dbr:Birkhoff_decomposition wikipedia-en:Birkhoff_algorithm n19:this dbr:John_von_Neumann dbr:Simultaneous_eating_algorithm n20:s_algorithm
wdrs:describedby
n8:Matrices n12:Dénes_Kőnig
dct:subject
dbc:Matrices dbc:Algorithms
dbo:wikiPageID
64692455
dbo:wikiPageRevisionID
1112396551
dbo:wikiPageWikiLink
dbr:NP-hard dbr:Perfect_matching dbr:Bipartite_graph dbr:Fair_random_assignment dbr:Vijay_Vazirani dbr:Garrett_Birkhoff n9:s_lemma dbr:Probabilistic-serial_procedure dbr:Greedy_algorithm dbc:Matrices dbr:Maximum_cardinality_matching dbr:Dénes_Kőnig dbr:Birkhoff_polytope dbr:Permutation_matrix dbc:Algorithms dbr:Bistochastic_matrix dbr:Envy-freeness n22:
foaf:isPrimaryTopicOf
wikipedia-en:Birkhoff_algorithm
prov:wasDerivedFrom
n14:0
dbo:abstract
Birkhoff's algorithm (also called Birkhoff-von-Neumann algorithm) is an algorithm for decomposing a bistochastic matrix into a convex combination of permutation matrices. It was published by Garrett Birkhoff in 1946. It has many applications. One such application is for the problem of fair random assignment: given a randomized allocation of items, Birkhoff's algorithm can decompose it into a lottery on deterministic allocations.
dbo:wikiPageLength
9904
dbp:wikiPageUsesTemplate
dbt:Reflist dbt:Rp