Treewidth - PDFSEARCH.IO - Document Search Engine

Treewidth
Results: 75

#	Item
41	Fast Distributed Network Decompositions and Covers Baruch Awerbuch y Bonnie Berger z David Peleg { Add to Reading List Source URL: www.cs.tufts.edu Language: English - Date: 2012-10-31 09:54:24 NP-complete problems Graph coloring Matroid theory Graph connectivity Ear decomposition Neighbourhood Degeneracy Maximal independent set Independent set Bridge Graph theory Treewidth
42	Maximum Motif Problem in Vertex-Colored Graphs ? Riccardo Dondi1 , Guillaume Fertin2 , and St´ephane Vialette3 1 Add to Reading List Source URL: pagesperso.lina.univ-nantes.fr Language: English - Date: 2011-04-27 05:28:57 NP-complete problems Graph coloring Graph connectivity Combinatorial optimization Matching Vertex cover Bridge Color-coding Treewidth Neighbourhood Covering graph Incidence coloring
43	Graph minors, decompositions and algorithms (Lecture notes) Jiˇr´ı Fiala Department of Applied Mathematics, Charles University, Prague Add to Reading List Source URL: kam.mff.cuni.cz Language: English - Date: 2014-06-02 07:40:12 Graph theory Planar graphs Graph operations Graph minor Pathwidth Treewidth Line graph Outerplanar graph Forbidden graph characterization Homeomorphism Intersection graph RobertsonSeymour theorem
44	Evidence-Specific Structures for Rich Tractable CRFs Carlos Guestrin Carnegie Mellon University Add to Reading List Source URL: select.cs.cmu.edu Language: English - Date: 2010-12-02 01:46:24 Graph theory Graphical models Machine learning Artificial intelligence Learning Statistical models Conditional random field Bayesian network Tree decomposition Treewidth Markov random field Expectationmaximization algorithm
45	Parameterized Complexity of Critical Node Cuts Danny Hermelin1 , Moshe Kaspi1 , Christian Komusiewicz2 , and Barak Navon1 1 2 Add to Reading List Source URL: drops.dagstuhl.de Language: English - Date: 2015-11-09 10:22:02 Graph theory Mathematics Treewidth Clique Vertex Tree decomposition Centrality Graph Degree Pathwidth Logic of graphs
46	Faster Algorithms for Algebraic Path Properties in RSMs with Constant Treewidth Abstract analysis, to data dependencies (modification and reference side effect), to constant propagation, to live and use analysis [11, 18 Add to Reading List Source URL: www.cs.au.dk Language: English - Date: 2015-08-11 05:53:50
47	Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs Krishnendu Chatterjee† Rasmus Ibsen-Jensen† † Add to Reading List Source URL: www.cs.au.dk Language: English - Date: 2015-08-11 05:53:51
48	Degree-3 Treewidth Sparsifiers∗ Chandra Chekuri† Julia Chuzhoy‡ October 3, 2014 Add to Reading List Source URL: ttic.uchicago.edu Language: English - Date: 2014-10-14 13:19:47
49	Degree-3 Treewidth Sparsifiers∗ Chandra Chekuri† Julia Chuzhoy‡ whose size is ideally polynomial in the parameter k, Add to Reading List Source URL: ttic.uchicago.edu Language: English - Date: 2014-10-14 13:20:13