Kernelization - PDFSEARCH.IO - Document Search Engine

Kernelization
Results: 67

#	Item
21	Parameterized Complexity-News The Newsletter of the Parameterized Complexity Community Volume 2, NovemberWelcome Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-09-04 06:03:49 NP-complete problems Analysis of algorithms Parameterized complexity Graph coloring Bidimensionality Kernelization Dominating set Branch-decomposition Vertex cover Theoretical computer science Graph theory Computational complexity theory
22	The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number ? Michael Fellows1,2 and Frances Rosamond1 Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-08-06 03:12:58 NP-complete problems Analysis of algorithms Parameterized complexity Kernelization Bidimensionality Dominating set Tree decomposition Path decomposition Feedback vertex set Theoretical computer science Computational complexity theory Graph theory
23	Limits and Applications of Group Algebras for Parameterized Problems Ioannis Koutis Computer Science Department Carnegie Mellon University Add to Reading List Source URL: ccom.uprrp.edu Language: English - Date: 2011-03-02 23:56:28 Analysis of algorithms Polynomials Algebraic geometry Commutative algebra Parameterized complexity XTR Kernelization Randomized algorithm Time complexity Theoretical computer science Mathematics Computational complexity theory
24	ICS 260 – Fall 2001 – Final Exam Name: Answer Key Student ID: 1: Add to Reading List Source URL: www.ics.uci.edu Language: English - Date: 2001-12-12 17:36:39 NP-complete problems Travelling salesman problem Independent set NP-complete Set cover problem NP Directed acyclic graph Kernelization Vertex cover Theoretical computer science Computational complexity theory Mathematics
25	Parameterized Approximation via Fidelity Preserving Transformations Michael R. Fellows1 , Ariel Kulik2 , Frances Rosamond1 , and Hadas Shachnai3? 1 School of Engineering and IT, Charles Darwin Univ., Darwin, NT Australi Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2012-03-01 11:15:08 NP-complete problems Analysis of algorithms Parameterized complexity Graph coloring Kernelization Dominating set Vertex cover Time complexity Steiner tree problem Theoretical computer science Computational complexity theory Applied mathematics
26	0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000 Add to Reading List Source URL: mrfellows.net Language: English - Date: 2009-09-08 08:50:37 NP-complete problems Analysis of algorithms Parameterized complexity Graph coloring Kernelization Dominating set Feedback vertex set Vertex cover Tree decomposition Theoretical computer science Graph theory Computational complexity theory
27	Greedy Localization, Iterative Compression and Modeled Crown Reductions: New FPT Techniques, an Improved Algorithm for Set Splitting and a Novel 2k Kernelization for Vertex Cover Frank Dehne1 , Mike Fellows2 , Frances Ro Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-08-06 03:09:48 NP-complete problems Parameterized complexity Kernelization Vertex cover Graph coloring Minimum k-cut Algorithm Independent set Greedy algorithm Theoretical computer science Mathematics Computational complexity theory
28	Blow-Ups, Win/Win’s, and Crown Rules: Some New Directions in FPT Michael R. Fellows School of Electrical Engineering and Computer Science University of Newcastle, University Drive, Callaghan NSW 2308, Australia mfellow Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-10-05 20:16:31 NP-complete problems Parameterized complexity Kernelization Dominating set Vertex cover Path decomposition Planar separator theorem Clique problem Graph coloring Theoretical computer science Graph theory Mathematics
29	Welcome Frances Rosamond, Editor Welcome to the Parameterized Complexity Newsletter. We are delighted to announce the IPEC 2010 winners of the Excellent Student Paper Awards. The meeting was expertly organized in Chennai Add to Reading List Source URL: fpt.wdfiles.com Language: English - Date: 2012-09-17 05:22:16 NP-complete problems Analysis of algorithms Parameterized complexity Kernelization Complexity classes Tree decomposition Dominating set International Colloquium on Automata Languages and Programming Vertex cover Theoretical computer science Computational complexity theory Applied mathematics
30	Parameterized Complexity-News The Newsletter of the Parameterized Complexity Community Volume 3, MayWelcome Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-09-04 06:03:09 NP-complete problems Bidimensionality Parameterized complexity Kernelization Branch-decomposition Path decomposition Tree decomposition Clique Feedback vertex set Graph theory Theoretical computer science Mathematics

UPDATE