Packing in a hypergraph

Results: 5



#Item
1COMPUTING THE PARTITION FUNCTION FOR PERFECT MATCHINGS IN A HYPERGRAPH Alexander Barvinok and Alex Samorodnitsky September 2011 Abstract. Given non-negative weights wS on the k-subsets S of a km-element

COMPUTING THE PARTITION FUNCTION FOR PERFECT MATCHINGS IN A HYPERGRAPH Alexander Barvinok and Alex Samorodnitsky September 2011 Abstract. Given non-negative weights wS on the k-subsets S of a km-element

Add to Reading List

Source URL: www.math.lsa.umich.edu

Language: English - Date: 2011-09-04 21:59:49
2arXiv:1304.7456v1 [cs.DS] 28 AprCounting Hypergraphs in Data Streams He Sun Max Planck Institute for Informatics Saarbr¨

arXiv:1304.7456v1 [cs.DS] 28 AprCounting Hypergraphs in Data Streams He Sun Max Planck Institute for Informatics Saarbr¨

Add to Reading List

Source URL: people.mpi-inf.mpg.de

Language: English - Date: 2013-05-03 12:26:04
3MATEMATIQKI VESNIK  UDK[removed]originalni nauqni rad research paper

MATEMATIQKI VESNIK UDK[removed]originalni nauqni rad research paper

Add to Reading List

Source URL: www.kurims.kyoto-u.ac.jp

Language: English - Date: 2007-06-30 07:02:24
4COLLOQUIA MATHEMATICA SOCIETATIS JAN05 BOLYAI 10 . INFINITE AND FINITE SETS, KESZTHELY (HUNGARY), 1973 .

COLLOQUIA MATHEMATICA SOCIETATIS JAN05 BOLYAI 10 . INFINITE AND FINITE SETS, KESZTHELY (HUNGARY), 1973 .

Add to Reading List

Source URL: www.cs.elte.hu

Language: English - Date: 2007-05-29 11:08:23
5

PDF Document

Add to Reading List

Source URL: hal.archives-ouvertes.fr

Language: English - Date: 2005-10-19 12:39:39