Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Packing_in_a_hypergraph> ?p ?o. }
Showing items 1 to 13 of
13
with 100 items per page.
- Packing_in_a_hypergraph abstract "In mathematics, a packing in a hypergraph is a partition of the set of the hypergraph's edges into a number of disjoint subsets such that no pair of edges in each subset share any vertex. There are two famous algorithms to achieve asymptotically optimal packing in k-uniform hypergraphs. One of them is a random greedy algorithm which was proposed by Joel Spencer. He used a branching process to formally prove the optimal achievable bound under some side conditions. The other algorithm is called the Rödl nibble and was proposed by Vojtěch Rödl et al. They showed that the achievable packing by the Rödl nibble is in some sense close to that of the random greedy algorithm.".
- Packing_in_a_hypergraph wikiPageExternalLink 1963-07.pdf.
- Packing_in_a_hypergraph wikiPageID "22759888".
- Packing_in_a_hypergraph wikiPageRevisionID "594986705".
- Packing_in_a_hypergraph hasPhotoCollection Packing_in_a_hypergraph.
- Packing_in_a_hypergraph subject Category:Hypergraphs.
- Packing_in_a_hypergraph comment "In mathematics, a packing in a hypergraph is a partition of the set of the hypergraph's edges into a number of disjoint subsets such that no pair of edges in each subset share any vertex. There are two famous algorithms to achieve asymptotically optimal packing in k-uniform hypergraphs. One of them is a random greedy algorithm which was proposed by Joel Spencer. He used a branching process to formally prove the optimal achievable bound under some side conditions.".
- Packing_in_a_hypergraph label "Packing in a hypergraph".
- Packing_in_a_hypergraph sameAs m.05zjxkp.
- Packing_in_a_hypergraph sameAs Q7123028.
- Packing_in_a_hypergraph sameAs Q7123028.
- Packing_in_a_hypergraph wasDerivedFrom Packing_in_a_hypergraph?oldid=594986705.
- Packing_in_a_hypergraph isPrimaryTopicOf Packing_in_a_hypergraph.