NP-complete - PDFSEARCH.IO - Document Search Engine

NP-complete
Results: 1728

#	Item
341	How to Grow More Pairs: Suggesting Review Targets For Comparison-Friendly Review Ecosystems James Cook ∗ UC Berkeley Add to Reading List Source URL: www2013.wwwconference.org Language: English - Date: 2014-07-21 08:47:06 Mathematics NP-complete problems Combinatorics Discrete mathematics Greedy algorithm Matroid theory Set cover problem Algorithm Combinatorial optimization
342	Practical Conflict Graphs for Dynamic Spectrum Distribution Xia Zhou, Zengbin Zhang, Gang Wang, Xiaoxiao Yu§ , Ben Y. Zhao and Haitao Zheng Department of Computer Science, U. C. Santa Barbara, USA § Tsinghua University Add to Reading List Source URL: www.cs.ucsb.edu Language: English - Date: 2013-03-23 01:40:10 Graph theory NP-complete problems Graph coloring Graph Global Positioning System Random graph
343	A new characterization of Pk -free graphs Eglantine Camby Universit´e Libre de Bruxelles D´epartement de Math´ematique Boulevard du Triomphe, 1050 Brussels, Belgium Add to Reading List Source URL: www.zaik.uni-koeln.de Language: English - Date: 2015-02-09 05:54:36 Graph theory Mathematics NP-complete problems Graph coloring Hypergraph Dominating set Ear decomposition Graph Line graph Modular decomposition
344	Hamiltonian index is NP-complete Zdenˇek Ryj´ aˇcek ∗ Department of Mathematics, University of West Bohemia, and Institute of Theoretical Computer Science (ITI), Add to Reading List Source URL: iti.mff.cuni.cz Language: English - Date: 2016-02-04 05:53:37
345	Finding Connected Subgraphs of Fixed Minimum Density: Implementation and Experiments? Christian Komusiewicz, Manuel Sorge, and Kolja Stahl Institut f¨ ur Softwaretechnik und Theoretische Informatik, TU Berlin, Germany Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2015-06-25 05:19:55 Graph theory NP-complete problems Graph operations Clique Degeneracy Tree Degree Vertex Neighbourhood Clique problem BronKerbosch algorithm
346	Contemporary Mathematics Graph Partitioning for Scalable Distributed Graph Computations Aydın Bulu¸c and Kamesh Madduri Abstract. Inter-node communication time constitutes a significant fraction Add to Reading List Source URL: gauss.cs.ucsb.edu Language: English - Date: 2013-03-15 01:10:50 Graph theory Mathematics NP-complete problems Graph partition Hypergraph Graph traversal Breadth-first search Vertex Graph Shortest path problem Ear decomposition HopcroftKarp algorithm
347	Denser than the Densest Subgraph: Extracting Optimal Quasi-Cliques with Quality Guarantees Charalampos E. Tsourakakis1 Francesco Bonchi2 Aristides Gionis3 2 Add to Reading List Source URL: www.francescobonchi.com Language: English - Date: 2013-06-09 08:58:15 Graph theory NP-complete problems Dense subgraph Clique BronKerbosch algorithm Cograph Modular product of graphs
348	PDF Document Add to Reading List Source URL: www.zib.de Language: English - Date: 2010-10-28 06:01:03 Mathematical optimization Numerical analysis Operations research Combinatorial optimization Mathematics NP-complete problems Numerical software Column generation Linear programming SCIP Branch and bound DantzigWolfe decomposition
349	PDF Document Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2014-10-07 11:22:31 Graph theory NP-complete problems Graph connectivity Graph operations Graph coloring Degeneracy Tree Neighbourhood Clique K-edge-connected graph Vertex cover Degree
350	PDF Document Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2015-05-03 06:37:17 Graph theory NP-complete problems Clique Independent set Split graph Neighbourhood Bipartite graph Degree Vertex Graph Line graph Chordal graph

UPDATE