NP-complete - PDFSEARCH.IO - Document Search Engine

NP-complete
Results: 1728

#	Item
781	Graph-Based Quadratic Optimization: A Fast Evolutionary Approach Samuel Rota Bul`oa , Marcello Pelilloa , Immanuel M. Bomzeb a DAIS - Universit` Add to Reading List Source URL: www.dsi.unive.it Language: English - Date: 2011-06-06 06:05:30 Evolutionary dynamics Combinatorial optimization NP-complete problems Matching Replicator equation Clique problem Clique Evolutionary game theory Mathematical optimization Graph theory Mathematics Theoretical computer science
782	HUNTER AREA HEALTH SERVICE SPEECH PATHOLOGISTS Add to Reading List Source URL: www.hnehealth.nsw.gov.au Language: English - Date: 2011-05-25 19:15:40 NP-complete problems Operations research
783	A General Approach to Online Network Optimization Problems Noga Alon∗ Baruch Awerbuch† Yossi Azar‡ Add to Reading List Source URL: www.cs.jhu.edu Language: English - Date: 2007-10-09 11:14:47 Combinatorial optimization NP-complete problems Spanning tree Analysis of algorithms Algorithms Randomized rounding Maximum flow problem Shortest path problem Steiner tree problem Theoretical computer science Mathematics Computational complexity theory
784	Módulo de Geração de Indicadores/Gráficos Estatísticos do SIAD Add to Reading List Source URL: www.rocq.inria.fr Language: English - Date: 2013-03-26 05:35:34 Network theory Networks NP-complete problems
785	Approximating matching size from random streams Michael Kapralov⇤ Sanjeev Khanna† Madhu Sudan‡ Add to Reading List Source URL: people.csail.mit.edu Language: English - Date: 2014-12-09 10:13:51 NP-complete problems Matching SL Randomized algorithm Hopcroft–Karp algorithm Theoretical computer science Computational complexity theory Mathematics
786	A Continuous Characterization of Maximal Cliques in k-uniform Hypergraphs Samuel Rota Bul`o, and Marcello Pelillo Dipartimento di Informatica. Universit` a Ca’ Foscari di Venezia. Add to Reading List Source URL: www.dsi.unive.it Language: English - Date: 2010-08-27 12:03:59 Graph operations Clique problem Clique Extremal graph theory Hypergraph Vertex cover Line graph Clique-sum Graph theory Theoretical computer science NP-complete problems
787	PUZZLES 27 SATURDAY JANUARYHOROSCOPES Add to Reading List Source URL: www.territorystories.nt.gov.au Language: English - Date: 2015-04-02 01:12:26 Cryptic crossword Sudoku Human behavior NP-complete problems Crosswords Mathematics
788	Bounding χ in terms of ω and ∆ for quasi-line graphs Andrew King and Bruce Reed May 8, 2007 Abstract A quasi-line graph is a graph in which the neighbourhood of any vertex Add to Reading List Source URL: andrewdouglasking.com.s3-website-us-west-2.amazonaws.com Language: English - Date: 2015-03-20 01:35:25 Line graph Clique Graph coloring Interval graph Neighbourhood Path decomposition Chordal graph Graph theory Graph operations NP-complete problems
789	Perfect Matchings in O(n log n) Time in Regular Bipartite Graphs Ashish Goel∗ Michael Kapralov† Sanjeev Khanna‡ Add to Reading List Source URL: people.csail.mit.edu Language: English - Date: 2014-12-09 10:13:49 Graph coloring Combinatorial optimization Hopcroft–Karp algorithm NP-complete problems Edge coloring Bipartite graph Eulerian path Connected component Connectivity Graph theory Mathematics Matching
790	Efficient Reasoning about Data Trees via Integer Linear Programming Claire David Leonid Libkin Add to Reading List Source URL: homepages.inf.ed.ac.uk Language: English - Date: 2010-12-15 16:00:04 Constraint programming Electronic design automation Formal methods Logic in computer science NP-complete problems Boolean satisfiability problem Symbol Tree automaton Satisfiability Theoretical computer science Applied mathematics Mathematics

UPDATE