NP-complete - PDFSEARCH.IO - Document Search Engine

NP-complete
Results: 1728

#	Item
851	Some hard graph problems in telecoms Keith Briggs Add to Reading List Source URL: keithbriggs.info Language: English - Date: 2006-10-27 09:09:17 NP-complete problems Graph coloring Graph operations Clique Independent set Graph Graph bandwidth Graph theory Theoretical computer science Mathematics
852	Multi-Threaded Modularity Based Graph Clustering using the Multilevel Paradigm Dominique LaSalle and George Karypis Department of Computer Science & Engineering, University of Minnesota, Minneapolis, MN 55455, USA Add to Reading List Source URL: www-users.cs.umn.edu Language: English - Date: 2014-08-08 11:17:12 NP-complete problems Matching Graph partition Modularity Neighbourhood Graph Tree Cluster analysis Consensus clustering Graph theory Mathematics Theoretical computer science
853	University of Scranton ACM Student Chapter / Computing Sciences Department 24th Annual High School Programming Contest (2014) -----------------------------------------------------------------------------Problem 1: Four-T Add to Reading List Source URL: www.cs.uofs.edu Language: English - Date: 2014-07-25 15:51:29 Graph coloring NP-complete problems
854	Microsoft Word - artNIKOppenJohan.doc Add to Reading List Source URL: www.nik.no Language: English - Date: 2004-12-12 14:26:35 Mathematics Vehicle routing problem operations research Travelling salesman problem Tabu search Aggregation Routing Arc routing Theoretical computer science NP-complete problems Applied mathematics
855	Ant Algorithms Unification and Improvement Hossein Hajimirsadeghi Control and Intelligent Processing Center of Excellence School of ECE, University of Tehran, Tehran, Iran [removed] Add to Reading List Source URL: www.cs.sfu.ca Language: English - Date: 2009-09-27 13:30:35 Operations research Ant colony optimization algorithms Stochastic optimization NP-complete problems Travelling salesman problem Multi-agent systems Swarm intelligence Combinatorial optimization Artificial Ants Theoretical computer science Applied mathematics Mathematics
856	The Livestock Collection Problem Johan Oppen, Arne Løkketangen Molde University College 6402 Molde, Norway Email: [removed] [removed] Add to Reading List Source URL: www.nik.no Language: English - Date: 2005-12-08 10:06:32 Operations research Heuristics NP-complete problems Animal rights Tabu search Vehicle routing problem Search algorithm Slaughterhouse Mathematical optimization Theoretical computer science Agriculture Applied mathematics
857	Efficient Subgraph Matching on Billion Node Graphs Zhao Sun ∗ Fudan University Add to Reading List Source URL: vldb.org Language: English - Date: 2012-05-30 02:58:50 Graph operations NP-complete problems Line graph Graph Matching Degree Neighbourhood Tree Shortest path problem Graph theory Mathematics Theoretical computer science
858	1 A brief overview of Complexity Theory The following brief overview is intended as a teaser for students in an introductory course on Complexity Theory. Out of the tough came forth sweetness1 Add to Reading List Source URL: www.wisdom.weizmann.ac.il Language: English - Date: 2014-06-22 06:25:17 Probabilistic complexity theory Computational complexity theory Mathematical optimization Structural complexity theory NP-complete Complexity NP P versus NP problem Probabilistically checkable proof Theoretical computer science Applied mathematics Complexity classes
859	Abstracts Manuel Bodirsky, Ecole Polytechnique The Product Ramsey Theorem in Constraint Satisfaction Complexity In this talk, I show how the product Ramsey theorem can be used jointly with tools from universal algebra to Add to Reading List Source URL: asz.informatik.hu-berlin.de Language: English - Date: 2008-06-05 10:03:31 Planar graphs Graph coloring NP-complete problems Matching Tree decomposition Edge coloring Clique Minimum spanning tree Shortest path problem Graph theory Theoretical computer science Graph operations
860	Contents Notation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . xii Part I The Classics 1 Add to Reading List Source URL: www.thi.informatik.uni-frankfurt.de Language: English - Date: 2011-11-11 10:20:33 NP-complete problems Topological graph theory Graph coloring Crossing number Inequalities Clique Independent set Combinatorics Matroid Graph theory Mathematics Theoretical computer science

UPDATE