doi:[removed]j.jpdc[removed]

First Page		Document Content
Date: 2011-12-04 14:11:42 Graph partition Bipartite graph Constraint graph Graph Octahedron Fiduccia-Mattheyses algorithm Line graph of a hypergraph Graph theory NP-complete problems Hypergraph		doi:[removed]j.jpdc[removed] Add to Reading List Source URL: snap.stanford.edu Download Document from Source Website File Size: 512,07 KB Share Document on Facebook

	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 DocID: 1nh5t - View Document
	A new characterization of Pk -free graphs Eglantine Camby Universit´e Libre de Bruxelles D´epartement de Math´ematique Boulevard du Triomphe, 1050 Brussels, Belgium DocID: 1kx92 - View Document
	Quasirandomness, Counting and Regularity for 3-Uniform Hypergraphs W. T. Gowers Abstract. The main results of this paper are regularity and counting lemmas for 3uniform hypergraphs. A combination of these two results giv DocID: 19z2R - View Document
	A Continuous Characterization of Maximal Cliques in k-uniform Hypergraphs Samuel Rota Bul`o, and Marcello Pelillo Dipartimento di Informatica. Universit` a Ca’ Foscari di Venezia. DocID: 16AAI - View Document
	Author’s manuscript accepted to Acta Informatica. Online available via DOIs00236Exploiting a Hypergraph Model for Finding Golomb Rulers Manuel Sorge · Hannes Moser · Rolf Niedermeier · Mathias W DocID: 158Sl - View Document