NP-complete - PDFSEARCH.IO - Document Search Engine

NP-complete
Results: 1728

#	Item
251	Constrained Level Generation through Grammar-Based Evolutionary Algorithms Jose M. Font1 , Roberto Izquierdo2 , Daniel Manrique2 , and Julian Togelius3 1 U-tad, Centro Universitario de Tecnolog´ıa y Arte Digital, C/P Add to Reading List Source URL: julian.togelius.com Language: English* - Date: 2016-03-20 21:33:21 Graph theory Procedural generation Cycle Graph coloring NP-complete problems Book:Graph Theory
252	Hamilton cycles in graphs and hypergraphs: an extremal perspective Abstract. As one of the most fundamental and well-known NP-complete problems, the Hamilton cycle problem has been the subject of intensive research. Rece Add to Reading List Source URL: web.mat.bham.ac.uk Language: English - Date: 2014-05-21 03:28:53
253	Storytelling and Clustering for Cellular Signaling Pathways M. Shahriar Hossain, Monika Akbar, Nicholas F. Polys Department of Computer Science, Virginia Tech, Blacksburg, VA 24061, USA. {msh, amonika, npolys}@vt.edu ABS Add to Reading List Source URL: www.cs.utep.edu Language: English - Date: 2010-09-07 10:56:06 Cluster analysis Data mining Geostatistics Graph operations Planar graphs NP-complete problems HCS clustering algorithm
254	Balls into bins via local search: cover time and maximum load Karl Bringmann1 , Thomas Sauerwald2 , Alexandre Stauffer3 , and He Sun1 1 2 Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2016-01-03 06:46:50 Graph theory Mathematics Expander graph Balls into bins NP-complete problems Quiver Eternal dominating set
255	In Intl. J. of Robotics Research 23(9):, September2004 A formal analysis and taxonomy of task allocation in multi-robot systems Brian P. Gerkey Artificial Intelligence Lab Add to Reading List Source URL: robotics.stanford.edu Language: English - Date: 2004-09-08 19:38:27 Mathematics NP-complete problems Combinatorics Discrete mathematics Operations research Theoretical computer science Combinatorial optimization Greedy algorithm Matroid theory Robotics Robot Assignment problem
256	SYNC or ASYNC: Time to Fuse for Distributed Graph-Parallel Computation Chenning Xie† Rong Chen† Add to Reading List Source URL: ipads.se.sjtu.edu.cn Language: English - Date: 2014-12-16 04:16:53 Graph theory Mathematics Discrete mathematics Graph coloring NP-complete problems Vertex Neighbourhood Distance
257	Kenken For Teachers Tom Davis http://www.geometer.org/mathcircles June 27, 2010 Add to Reading List Source URL: www.geometer.org Language: English - Date: 2010-06-27 17:50:19 Logic puzzles NP-complete problems Mathematics Recreational mathematics Puzzles Leisure Puzzle video games KenKen Crossword Sudoku 15 puzzle Futoshiki
258	Lower and Upper Competitive Bounds for Online Directed Graph ExplorationI Klaus-Tycho Foerstera,1,∗, Roger Wattenhofera a ETH Z¨ Add to Reading List Source URL: www.tik.ee.ethz.ch Language: English - Date: 2016-02-08 07:16:33 Graph theory Mathematics Combinatorial optimization Edsger W. Dijkstra Routing algorithms Search algorithms NP-complete problems Graph traversal Shortest path problem Matching A* search algorithm Planar graph
259	Distributed Verification and Hardness of Distributed ∗ Approximation Atish Das Sarma † Add to Reading List Source URL: www.tik.ee.ethz.ch Language: English - Date: 2015-05-18 12:16:16 Graph theory Mathematics Computational complexity theory Spanning tree NP-complete problems Dominating set Minimum spanning tree Maximal independent set Matching Travelling salesman problem Shortest path problem Tree
260	JMLR: Workshop and Conference Proceedings vol 40:1–33, 2015 Stochastic Block Model and Community Detection in Sparse Graphs: A spectral algorithm with optimal rate of recovery ∗ Peter Chin Add to Reading List Source URL: jmlr.org Language: English - Date: 2015-07-20 20:08:35 Mathematics Graph theory Discrete mathematics NP-complete problems Combinatorics Partition of a set Planar separator theorem Graph coloring

UPDATE