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.

First Page		Document Content
Date: 2010-08-27 12:03:59 Graph operations Clique problem Clique Extremal graph theory Hypergraph Vertex cover Line graph Clique-sum Graph theory Theoretical computer science NP-complete problems		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. Add to Reading List Source URL: www.dsi.unive.it Download Document from Source Website File Size: 273,64 KB Share Document on Facebook

	The size of a hypergraph and its matching number Hao Huang∗ Po-Shen Loh† Benny Sudakov‡ DocID: 1v4qG - View Document
	Recommended Reading Efficient Parallel Sparse Matrix–Vector Multiplication Using Graph and Hypergraph Partitioning U.V. C DocID: 1uzWI - View Document
	Graph and hypergraph oloring Mi hael Krivelevi h 1. Basi denitions: vertex oloring, hromati number, edge oloring, hromati index. Coloring innite graphs, De Brujin-Erd}os theorem 2. Vertex degrees and olorings. DocID: 1upWX - View Document
	A Constraint-Based Hypergraph Partitioning Approach to Coreference Resolution Emili Sapena∗ Universitat Polit`ecnica de Catalunya Llu´ıs Padro´ ∗∗ DocID: 1ufaZ - View Document
	Technical Report BU-CE-1201 Hypergraph-Partitioning-Based Models and Methods for Exploiting Cache Locality in Sparse-Matrix Vector Multiplication Kadir Akbudak, Enver Kayaaslan and Cevdet Aykanat DocID: 1ublN - View Document