Clique-sum - PDFSEARCH.IO - Document Search Engine

Clique-sum
Results: 27

#	Item
1	Proof, beliefs, and algorithms through the lens of sum-of-squares 1 An integrality gap for the planted clique problem The Planted Clique problem (sometimes referred to as the hidden clique Add to Reading List Source URL: sumofsquares.org - Date: 2016-11-17 19:44:26
2	JMLR: Workshop and Conference Proceedings vol 40:1–40, 2015 28th Annual Conference on Learning Theory Improved Sum-of-Squares Lower Bounds for Hidden Clique and Hidden Submatrix Problems Add to Reading List Source URL: jmlr.org Language: English - Date: 2015-07-20 20:08:36 Probability distributions Clique problem Expected value Planted clique Matrix Markov chain Normal distribution
3	Improved Sum-of-Squares Lower Bounds for Hidden Clique and Hidden Submatrix Problems Yash Deshpande∗ and Andrea Montanari† February 28, 2015 Abstract Add to Reading List Source URL: web.stanford.edu Language: English - Date: 2015-04-23 23:13:32
4	On Computing Graph Minor Obstruction Sets ∗ Kevin Cattell Department of Computer Science University of Victoria Victoria, B.C. V8W 3P6, Canada Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-10-06 02:54:05 Robertson–Seymour theorem Tree decomposition Minor Planar graph Linkless embedding Graph coloring Graph structure theorem Clique-sum Graph theory Graph operations Path decomposition
5	ELSEVIER Information Processing Letters Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-08-06 03:07:31 Tree decomposition Robertson–Seymour theorem Minor Chordal graph Tree Graph Planar graphs Degeneracy Clique-sum Graph theory Path decomposition Graph operations
6	Image and Vision Computing–922 Contents lists available at ScienceDirect Image and Vision Computing journal homepage: www.elsevier.com/locate/imavis Add to Reading List Source URL: www.dsi.unive.it Language: English - Date: 2010-08-27 12:14:18 Clique Cograph K-tree Matching Maximal independent set Clique-sum Graph theory Graph operations NP-complete problems
7	Independent Set in P5-Free Graphs in Polynomial Time Daniel Lokshtanov∗ Martin Vatshelle∗ Yngve Villanger∗ Add to Reading List Source URL: www.ii.uib.no Language: English - Date: 2013-10-25 09:59:52 Chordal graph Clique Maximal independent set Split graph Tree decomposition Cograph Independent set Neighbourhood Clique-sum Graph theory Graph operations NP-complete problems
8	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 Language: English - 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
9	New Bounds on the Clique Number of Graphs Based on Spectral Hypergraph Theory Samuel Rota Bul`o and Marcello Pelillo Dipartimento di Informatica, Universit` a Ca’ Foscari di Venezia, Venice, Italy {srotabul,pelillo}@ds Add to Reading List Source URL: www.dsi.unive.it Language: English - Date: 2010-08-27 12:10:08 Spectral radius Adjacency matrix Hypergraph Spectral graph theory Graph operations Perron–Frobenius theorem Clique-sum Graph theory Mathematics Clique
10	You hereby find Figure 3 from your paper. I have problem with the clique consisting of threshold-9 players. For all other cliques in this example, it is the case that a player’s threshold is equal to the sum of numb Add to Reading List Source URL: chwe.net Language: English - Date: 2012-05-24 15:22:00 Networks Clique percolation method Clique problem Graph theory Clique Threshold