NP-complete - PDFSEARCH.IO - Document Search Engine

NP-complete
Results: 1728

#	Item
651	Ranking Tournaments: Local Search and a New Algorithm TOM COLEMAN and ANTHONY WIRTH The University of Melbourne Ranking is a fundamental activity for organising and, later, understanding data. Advice of the Add to Reading List Source URL: tom.thesnail.org Language: English - Date: 2015-05-04 03:09:24 NP-complete problems Topological sorting Directed graph Algorithm Feedback arc set Network theory Shortest path problem Graph theory Mathematics Theoretical computer science
652	A linear-time algorithm for comparing similar ordered trees H´el`ene Touzet LIFL – University of Lille 1 – France Comparison with k errors Add to Reading List Source URL: www.cs.ucr.edu Language: English - Date: 2005-07-08 16:24:06 Tree Spanning tree NP-complete problems Levenshtein distance Graph theory Theoretical computer science Mathematics
653	Mathematics Lock Challenge from the Maths Advisor, Jim Hogan How many locks can you open? First Lock What do the numbers add up to on a completed 9x9 Sudoku? Add to Reading List Source URL: schools.reap.org.nz Language: English - Date: 2014-10-23 07:13:05 Sudoku NP-complete problems Lock Puzzle Number Counting Sudoku algorithms Mathematics of Sudoku Mathematics Logic puzzles Recreational mathematics
654	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
655	Approximating TSP on Metrics with Bounded Global Growth∗ T-H. Hubert Chan Abstract The Traveling Salesman Problem (TSP) is a canonical NP-complete problem which is known to be MAXSNP hard even on (high-dimensional) Euc Add to Reading List Source URL: i.cs.hku.hk Language: English - Date: 2007-10-10 14:10:39 Metric geometry Dimension theory Fractals Machine learning Mathematical analysis Travelling salesman problem Tree decomposition Ε-net Nearest neighbor search Mathematics Theoretical computer science Geometry
656	Maximum Motif Problem in Vertex-Colored Graphs Add to Reading List Source URL: www.cs.ucr.edu Language: English - Date: 2009-06-21 01:15:30 Graph coloring NP-complete problems Graph theory Parameterized complexity NP-complete Theoretical computer science Mathematics Applied mathematics
657	Fast Algorithms for Computing Tree LCS Shay Mozes1 Dekel Tsur2 Oren Weimann3 Michal Ziv-Ukelson2 1 Brown University Add to Reading List Source URL: www.cs.ucr.edu Language: English - Date: 2008-06-17 10:13:00 Analysis of algorithms Time complexity Tree Spanning tree NP-complete problems Theoretical computer science Computational complexity theory Applied mathematics
658	Approximation Algorithms for Orienting Mixed Graphs Add to Reading List Source URL: www.cs.ucr.edu Language: English - Date: 2011-09-25 15:14:20 NP-complete problems Graph Directed graph Strongly connected component Strong orientation Graph coloring Path decomposition Graph theory Mathematics Graph connectivity
659	Randomized and Parameterized Algorithms for the Closest String Problem Zhi-Zhong Chen Tokyo Denki University Joint with Add to Reading List Source URL: www.cs.ucr.edu Language: English - Date: 2014-06-14 17:20:02 Analysis of algorithms NP-complete problems Closest string Randomized algorithm String Time complexity Algorithm 2-satisfiability NP Theoretical computer science Computational complexity theory Applied mathematics
660	arXiv:1107.1052v1 [cs.DS] 6 JulThe traveling salesman problem on cubic and subcubic graphs∗ Sylvia Boyd† Add to Reading List Source URL: arxiv.org Language: English - Date: 2011-07-06 20:12:57 Matching Eulerian path Petersen graph Travelling salesman problem Graph Tree Chordal graph Hamiltonian path Planar graph Graph theory NP-complete problems Cubic graph

UPDATE