Results overview: Found 2 records in 0.02 seconds.
Research literature, 2 records found
Research literature 2 records found  
1.
13 p, 252.9 KB Computing hypergraph width measures exactly / Moll, Lukas ; Tazari, Siamak ; Thurley, Marc ; Centre de Recerca Matemàtica
Hypergraph width measures are a class of hypergraph invariants important in studying the complexity of constraint satisfaction problems (CSPs). We present a general exact exponential algorithm for a large variety of these measures. [...]
Centre de Recerca Matemàtica 2011 (Prepublicacions del Centre de Recerca Matemàtica ; 1033)  
2.
24 p, 256.5 KB Propagation connectivity of random hypergraphs / Coja-Oghlan, Amin ; Onsjö, Mikael ; Watanabe, Osamu ; Centre de Recerca Matemàtica
We study the concept of propagation connectivity on random 3-uniform hypergraphs. This concept is inspired by a simple linear time algorithm for solving instances of certain constraint satisfaction problems. [...]
Centre de Recerca Matemàtica 2010 (Prepublicacions del Centre de Recerca Matemàtica ; 948)  

Interested in being notified about new results for this query?
Set up a personal email alert or subscribe to the RSS feed.