Clique cover problem - PDFSEARCH.IO - Document Search Engine

Clique cover problem
Results: 16

#	Item
1	Using Strong Triadic Closure to Characterize Ties in Social Networks Stavros Sintos Panayiotis Tsaparas Add to Reading List Source URL: www.cs.uoi.gr Language: English - Date: 2014-09-25 06:28:22 Graph theory Mathematics NP-complete problems Combinatorial optimization Graph connectivity Graph coloring Graph Matching Triadic closure Clique problem Vertex cover Clique
2	Journal of Complex Networks, 177–186 doi:comnet/cnv020 Advance Access publication on 21 July 2015 Network installation under convex costs Alexander Gutfraind† Add to Reading List Source URL: www.levreyzin.com Language: English - Date: 2016-07-01 10:19:11 NP-complete problems Clique problem Vertex cover Clique Independent set Bipartite graph Travelling salesman problem Graph coloring Line graph Treewidth Pathwidth
3	CME 305: Discrete Mathematics and Algorithms Instructor: Reza Zadeh () HW#3 – Due at the beginning of class ThursdayConsider a model of a nonbipartite undirected graph in which two partic Add to Reading List Source URL: stanford.edu Language: English - Date: 2015-03-23 01:42:07 NP-complete problems Clique problem Vertex cover Matching Eulerian path Clique Minimum spanning tree Randomized algorithm Connectivity Graph theory Theoretical computer science Mathematics
4	CME 305: Discrete Mathematics and Algorithms Instructor: Reza Zadeh () HW#3 – Due at the beginning of class ThursdayConsider a model of a nonbipartite undirected graph in which two partic Add to Reading List Source URL: stanford.edu Language: English - Date: 2015-03-23 01:42:05 NP-complete problems Clique Travelling salesman problem Vertex cover NP-complete Cut Path decomposition Feedback vertex set Graph theory Theoretical computer science Mathematics
5	Parameterized Complexity News The Newsletter of the Parameterized Complexity Community fpt.wikidot.com May 2009 Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-09-04 05:57:59 NP-complete problems Analysis of algorithms Graph coloring Parameterized complexity Complexity classes Kernelization Time complexity Clique problem Vertex cover Theoretical computer science Computational complexity theory Graph theory
6	URL: http://www.elsevier.nl/locate/entcs/volume61.html 19 pages Parameterized Complexity: The Main Ideas and Connections to Practical Computing Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-08-06 03:10:30 NP-complete problems Analysis of algorithms Complexity classes Parameterized complexity Dominating set Kernelization Vertex cover Clique problem NP-complete Theoretical computer science Computational complexity theory Applied mathematics
7	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
8	CS109B Notes for LectureNP-Complete Problems We have met some problems that have \easy" solutions; they have algorithms that run in time that is polynomial in the size of the graph, the parameter m. Examples: Add to Reading List Source URL: infolab.stanford.edu Language: English - Date: 2008-09-19 00:58:50 NP-complete problems Graph coloring Independent set NP-complete Clique Vertex cover NP Clique cover problem Domatic number Theoretical computer science Graph theory Computational complexity theory
9	The Parameterized Complexity of the Rainbow Subgraph Problem Falk Hüffner? , Christian Komusiewicz?? , Rolf Niedermeier, and Martin Rötzschke Institut für Softwaretechnik und Theoretische Informatik, TU Berlin, German Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2014-07-31 12:35:33 NP-complete problems Graph coloring Degeneracy Vertex cover Edge coloring Clique Vertex Graph Dense subgraph Graph theory Theoretical computer science Mathematics
10	k Newsletter of the Parameterized Complexity Community fpt.wikidot.com www.fpt.wikidot.com Add to Reading List Source URL: fpt.wdfiles.com Language: English - Date: 2014-10-14 03:31:39 Complexity classes NP-complete problems Analysis of algorithms Parameterized complexity Michael Fellows Kernelization Clique problem Vertex cover Path decomposition Theoretical computer science Computational complexity theory Applied mathematics

UPDATE