Treewidth - PDFSEARCH.IO - Document Search Engine

Treewidth
Results: 75

#	Item
61	The maximum edge-disjoint paths problem in bounded treewidth graphs Chandra Chekuri, Guyslain Naves, Bruce Shepherd Bellairs workshop, April 2011 Add to Reading List Source URL: assert-false.net Language: English - Date: 2015-08-13 19:29:27
62	Decompositions of Triangle-Dense Graphs∗ Rishi Gupta† Tim Roughgarden‡ C. Seshadhri Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2015-11-25 19:09:26 Graph theory Neighbourhood Clique Bipartite graph Planar graph Graph Treewidth Dense graph Triangle Graph operations Graph coloring Triangle-free graph
63	T HEORY OF C OMPUTING www.theoryofcomputing.org Can you beat treewidth?∗ D´aniel Marx† February 17, 2010 Add to Reading List Source URL: www.cs.bme.hu Language: English - Date: 2010-02-17 09:46:24
64	Lectures 6, 7 beginning of 8– Treewidth and graph minors Uriel Feige Department of Computer Science and Applied Mathematics The Weizman Institute Rehovot 76100, Israel Add to Reading List Source URL: www.wisdom.weizmann.ac.il Language: English - Date: 2014-05-19 11:45:45
65	Treewidth and graph minors Lectures 9 and 10, December 29, 2011, January 5, 2012 We shall touch upon the theory of Graph Minors by Robertson and Seymour. This theory gives a very general condition under which a graph pro Add to Reading List Source URL: www.wisdom.weizmann.ac.il Language: English - Date: 2012-01-05 11:55:55 Tree decomposition Graph coloring Minor Tree Robertson–Seymour theorem Clique Neighbourhood Graph Bipartite graph Graph theory Graph operations Planar graphs
66	Treewidth in Verification: Local vs. Global⋆ Andrea Ferrara1 , Guoqiang Pan2 , and Moshe Y. Vardi2 1 DIS - Universit`a di Roma ”La Sapienza” Via Salaria 113, 00198 Roma, Italy Add to Reading List Source URL: www.cs.rice.edu Language: English - Date: 2005-09-30 15:47:37 Tree decomposition Path decomposition Width Boolean satisfiability problem Graph theory Theoretical computer science Graph operations
67	Journal of Artificial Intelligence Research–388 Submitted 10/11; publishedComputing All-Pairs Shortest Paths by Leveraging Low Treewidth Add to Reading List Source URL: jair.org Language: English - Date: 2012-03-19 16:09:33 Tree decomposition Interval graph Floyd–Warshall algorithm Neighbourhood Clique Split graph Shortest path problem Path decomposition Degeneracy Graph theory Graph operations Chordal graph
68	Journal of Artificial Intelligence Research–388 Submitted 10/11; publishedComputing All-Pairs Shortest Paths by Leveraging Low Treewidth Add to Reading List Source URL: www.jair.org Language: English - Date: 2012-03-19 16:09:33 Tree decomposition Interval graph Floyd–Warshall algorithm Neighbourhood Clique Split graph Shortest path problem Path decomposition Degeneracy Graph theory Graph operations Chordal graph
69	Graph Pricing Problem on Bounded Treewidth, Bounded Genus and k-Partite Graphs Add to Reading List Source URL: cjtcs.cs.uchicago.edu Language: English - Date: 2013-11-08 11:23:34 NP-complete problems Graph operations Tree decomposition Vertex cover Minor Planar graph Dynamic programming Path decomposition Apex graph Graph theory Theoretical computer science Mathematics
70	On Low Treewidth Approximations of Conjunctive Queries Pablo Barcel´ o1, Leonid Libkin2 , and Miguel Romero1 1 Add to Reading List Source URL: homepages.inf.ed.ac.uk Language: English - Date: 2012-12-12 05:59:43 Graph operations Conjunctive query Database theory Tree decomposition Complexity classes Structure FO Boolean conjunctive query Graph theory Theoretical computer science Mathematics

UPDATE