NP-complete

Results: 1728



#Item
201Morphisms / Graph theory / NP-complete problems / Graph coloring / Graph operations / Pathwidth / Graph homomorphism / Treewidth / Cograph / Graph isomorphism / Indifference graph / Clique-width

Finding vertex-surjective graph homomorphisms⇤ Petr A. Golovach†, Bernard Lidick´ y‡, † Barnaby Martin, and Dani¨el Paulusma†

Add to Reading List

Source URL: orion.math.iastate.edu

Language: English - Date: 2014-08-22 14:45:03
202Matrix theory / Linear algebra / Matrices / Algebra / Determinant / Matrix / Square matrix / Eigenvalues and eigenvectors / Matrix exponential / Positive-definite matrix

P-matrix recognition is co-NP-complete Jan Foniok ETH Zurich, Institute for Operations Research R¨amistrasse 101, 8092 Zurich, Switzerland

Add to Reading List

Source URL: www.ifor.math.ethz.ch

Language: English - Date: 2007-10-22 07:27:16
203Graph coloring / Hypergraphs / NP-complete problems / Vertex cover / Edge coloring / Matching / Constraint programming / ErdsFaberLovsz conjecture / Constraint graph

Exercise 12: Weed Weak models Task 1: Hyper, hyper! Recall that a hypergraph is a graph where edges may comprise more than 2 nodes. The degree of a hyperedge is the number of nodes in it. Consider a hypergraph of maximum

Add to Reading List

Source URL: resources.mpi-inf.mpg.de

Language: English - Date: 2015-01-20 10:45:26
204Operations research / Discrete geometry / NP-complete problems / Conjectures / Circle packing / Sphere packing / Independent set / Kepler conjecture / Tammes problem / Mathematical optimization / Semidefinite programming / FranklRdl graph

Moment methods in energy minimization David de Laat CWI Amsterdam Andrejewski-Tage Moment problems in theoretical physics

Add to Reading List

Source URL: www.daviddelaat.nl

Language: English
205NP-complete problems / Trapezoid graph / Interval graph / Perfect graph / Indifference graph / Independent set / Permutation graph / Clique problem / Hamiltonian path problem / Longest path problem / Pathwidth / Intersection graph

Combinatorial Optimization and Recognition of Graph Classes with Applications to Related Models

Add to Reading List

Source URL: community.dur.ac.uk

Language: English - Date: 2009-12-21 16:02:55
206Graph theory / NP-complete problems / Graph connectivity / Graph minor / Graph operations / Graph coloring / Graph / K-edge-connected graph / Degree / Tree / Planar graph / Line graph

Excluding Graphs as Immersions in Surface Embedded Graphs Archontia C. Giannopoulou1,?,?? , Marcin Kami´nski2 , and Dimitrios M. Thilikos3? ? ? 1 2

Add to Reading List

Source URL: rutcor.rutgers.edu

Language: English - Date: 2013-04-23 04:28:57
207Data mining / NP-complete problems / Submodular set function / Greedy algorithm / Algorithm / Automatic summarization / XTR / Set cover problem

Selecting a Comprehensive Set of Reviews Panayiotis Tsaparas Alexandros Ntoulas∗ Evimaria Terzi†

Add to Reading List

Source URL: www.cs.uoi.gr

Language: English - Date: 2011-11-03 14:00:49
208NP-complete problems / NP / Set cover problem / Vertex cover / Thorn / Approximation algorithm

IEEE/ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS, VOL. 5, NO. 2,

Add to Reading List

Source URL: community.dur.ac.uk

Language: English - Date: 2008-04-10 08:31:28
209Morphisms / Graph theory / NP-complete problems / Graph isomorphism / Core / Graph homomorphism / Homomorphism / Duality / Subgraph isomorphism problem / Group theory

Graphs and Homomorphisms Our contribution Finding vertex-surjective graph homomorphisms Petr Golovach, Bernard Lidick´y,

Add to Reading List

Source URL: www.bedewell.com

Language: English - Date: 2012-07-03 09:45:04
210NP-complete problems / Planted clique / Clique problem / Clique / Graph partition / Maximum cut / Probability distribution

CS369N: Beyond Worst-Case Analysis Lecture #4: Probabilistic and Semirandom Models for Clustering and Graph Partitioning∗ Tim Roughgarden† April 25, 2010

Add to Reading List

Source URL: theory.stanford.edu

Language: English - Date: 2011-09-26 19:00:24
UPDATE