Clique-sum - PDFSEARCH.IO - Document Search Engine

Clique-sum
Results: 27

#	Item
11	Common Pharmacophore Identification Using Frequent Clique Detection Algorithm Yevgeniy Podolyan and George Karypis University of Minnesota, Department of Computer Science and Computer Engineering Minneapolis, MN[removed]Oc Add to Reading List Source URL: www.dtc.umn.edu Language: English - Date: 2012-08-16 12:29:06 Cograph Tree Clique-sum Clique problem Graph theory Graph operations Clique
12	Dynamic Generators of Topologically Embedded Graphs David Eppstein Univ. of California, Irvine School of Information and Computer Science Add to Reading List Source URL: www.ics.uci.edu Language: English - Date: 2003-01-14 20:58:23 Planar separator theorem Chordal graph Graph Tree decomposition Neighbourhood Topology Path decomposition Clique-sum Graph theory Planar graphs Graph operations
13	STAT 535 Lecture 6 Inference in Graphical models: Sum-Product Algorithm c Marina Meil˘a [removed] Add to Reading List Source URL: www.stat.washington.edu Language: English - Date: 2015-02-05 19:48:58 Clique Graphical model NP-complete problems Tree decomposition Belief propagation Path decomposition Clique problem Graph theory Graph operations Chordal graph
14	Contraction Bidimensionality: the Accurate Picture⋆ Fedor V. Fomin1 , Petr Golovach1 , and Dimitrios M. Thilikos2 1 2 Add to Reading List Source URL: drops.dagstuhl.de Language: English - Date: 2010-03-02 04:30:56 Minor Path decomposition Tree decomposition Bidimensionality Edge contraction Clique-sum Robertson–Seymour theorem Apex graph Planar graph Graph theory Theoretical computer science Graph operations
15	Sum of Squares Upper Bounds, Lower Bounds, and Open Questions Boaz Barak December 10, 2014 2 Add to Reading List Source URL: www.boazbarak.org Language: English - Date: 2014-12-10 16:53:22 Algorithm Clique problem Combinatorics NP PP Proof complexity Algorithmic Lovász local lemma Switching lemma Theoretical computer science Computational complexity theory Applied mathematics
16	Local Search: Is Brute-Force Avoidable? Add to Reading List Source URL: ijcai.org Language: English - Date: 2009-06-22 08:17:00 Planar graphs NP-complete problems Tree decomposition Minor Apex graph Graph Clique-sum Neighbourhood Vertex cover Graph theory Theoretical computer science Graph operations
17	The Bidimensionality Theory and Its Algorithmic Applications by MohammadTaghi Hajiaghayi B.S., Sharif University of Technology, 2000 Add to Reading List Source URL: erikdemaine.org Language: English - Date: 2005-07-24 15:36:22 NP-complete problems Analysis of algorithms Bidimensionality Parameterized complexity Planar graphs Tree decomposition Clique-sum Minor Branch-decomposition Graph theory Theoretical computer science Graph operations
18	doi:[removed]j.tcs[removed] Add to Reading List Source URL: snap.stanford.edu Language: English - Date: 2011-11-19 02:39:01 Graph operations Clique Bron–Kerbosch algorithm Maximal independent set Independent set Line graph Clique-sum Graph theory Theoretical computer science NP-complete problems
19	1120 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 49, NO. 5, MAY 2003 Tree-Based Reparameterization Framework for Analysis of Sum-Product and Related Algorithms Add to Reading List Source URL: www.eecs.berkeley.edu Language: English - Date: 2003-05-25 16:25:43 Statistical models Spanning tree Belief propagation Coding theory Factor graph Tree decomposition Tree Bayesian network Clique Graph theory Graphical models Bayesian statistics
20	TE C HNI C A L R E P O R T ¨ I NFORMATIONSSYSTEME I NSTITUT F UR A BTEILUNG DATENBANKEN Add to Reading List Source URL: www.dbai.tuwien.ac.at Language: English - Date: 2011-07-08 05:36:04 Tree decomposition Clique-width Clique Dynamic programming Parameterized complexity Path decomposition Clique-sum Graph theory Theoretical computer science Graph operations