Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/Packing_in_a_hypergraph> ?p ?o }
Showing triples 1 to 47 of
47
with 100 triples 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 wikiPageLength "12887".
- Packing_in_a_hypergraph wikiPageOutDegree "34".
- Packing_in_a_hypergraph wikiPageRevisionID "619216527".
- Packing_in_a_hypergraph wikiPageWikiLink Branching_process.
- Packing_in_a_hypergraph wikiPageWikiLink Category:Hypergraphs.
- Packing_in_a_hypergraph wikiPageWikiLink Covering_number.
- Packing_in_a_hypergraph wikiPageWikiLink Graph_coloring.
- Packing_in_a_hypergraph wikiPageWikiLink Greedy_algorithm.
- Packing_in_a_hypergraph wikiPageWikiLink Haim_Hanani.
- Packing_in_a_hypergraph wikiPageWikiLink Hypergraph.
- Packing_in_a_hypergraph wikiPageWikiLink Independent_set_(graph_theory).
- Packing_in_a_hypergraph wikiPageWikiLink Israel_Journal_of_Mathematics.
- Packing_in_a_hypergraph wikiPageWikiLink Jeong_Han_Kim.
- Packing_in_a_hypergraph wikiPageWikiLink Joel_Spencer.
- Packing_in_a_hypergraph wikiPageWikiLink Journal_of_Combinatorial_Theory.
- Packing_in_a_hypergraph wikiPageWikiLink Noga_Alon.
- Packing_in_a_hypergraph wikiPageWikiLink Optimal_packing.
- Packing_in_a_hypergraph wikiPageWikiLink Packing_problems.
- Packing_in_a_hypergraph wikiPageWikiLink Partition_of_a_set.
- Packing_in_a_hypergraph wikiPageWikiLink Paul_Erdős.
- Packing_in_a_hypergraph wikiPageWikiLink Poisson_distribution.
- Packing_in_a_hypergraph wikiPageWikiLink Ramseys_theorem.
- Packing_in_a_hypergraph wikiPageWikiLink Set_cover_problem.
- Packing_in_a_hypergraph wikiPageWikiLink Set_packing.
- Packing_in_a_hypergraph wikiPageWikiLink Sphere_packing.
- Packing_in_a_hypergraph wikiPageWikiLink Steiner_system.
- Packing_in_a_hypergraph wikiPageWikiLink Steiner_triple_system.
- Packing_in_a_hypergraph wikiPageWikiLink Vojtěch_Rödl.
- Packing_in_a_hypergraph wikiPageWikiLinkText "Erdős-Hanani conjecture".
- Packing_in_a_hypergraph wikiPageWikiLinkText "Packing in a hypergraph".
- Packing_in_a_hypergraph hasPhotoCollection Packing_in_a_hypergraph.
- Packing_in_a_hypergraph wikiPageUsesTemplate Template:Citation.
- Packing_in_a_hypergraph wikiPageUsesTemplate Template:Refbegin.
- Packing_in_a_hypergraph wikiPageUsesTemplate Template:Refend.
- Packing_in_a_hypergraph subject Category:Hypergraphs.
- Packing_in_a_hypergraph hypernym Partition.
- Packing_in_a_hypergraph type AnatomicalStructure.
- 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=619216527.
- Packing_in_a_hypergraph isPrimaryTopicOf Packing_in_a_hypergraph.