Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Clique_cover_problem> ?p ?o. }
Showing items 1 to 28 of
28
with 100 items per page.
- Clique_cover_problem abstract "In computational complexity theory, finding a minimum clique cover is a graph-theoretical NP-complete problem. The problem was one of Richard Karp's original 21 problems shown NP-complete in his 1972 paper "Reducibility Among Combinatorial Problems".The clique cover problem (also sometimes called partition into cliques) is the problem of determining whether the vertices of a graph can be partitioned into k cliques. Given a partition of the vertices into k sets, it can be verified in polynomial time that each set forms a clique, so the problem is in NP. The NP-completeness of clique cover follows by reduction from GRAPH k-COLOURABILITY. To see this, first transform an instance G of GRAPH k-COLOURABILITY into its complement graph G'. A partition of G' into k cliques then corresponds to finding a partition of the vertices of G into k independent sets; each of these sets can then be assigned one colour to yield a k-colouring.The related clique edge cover problem considers sets of cliques that include all of the edges of a given graph. It is also NP-complete.".
- Clique_cover_problem wikiPageExternalLink karp.pdf.
- Clique_cover_problem wikiPageID "17113364".
- Clique_cover_problem wikiPageRevisionID "542928342".
- Clique_cover_problem hasPhotoCollection Clique_cover_problem.
- Clique_cover_problem subject Category:Computational_problems_in_graph_theory.
- Clique_cover_problem subject Category:NP-complete_problems.
- Clique_cover_problem type Abstraction100002137.
- Clique_cover_problem type Attribute100024264.
- Clique_cover_problem type ComputationalProblemsInGraphTheory.
- Clique_cover_problem type Condition113920835.
- Clique_cover_problem type Difficulty114408086.
- Clique_cover_problem type NP-completeProblems.
- Clique_cover_problem type Problem114410605.
- Clique_cover_problem type State100024720.
- Clique_cover_problem comment "In computational complexity theory, finding a minimum clique cover is a graph-theoretical NP-complete problem. The problem was one of Richard Karp's original 21 problems shown NP-complete in his 1972 paper "Reducibility Among Combinatorial Problems".The clique cover problem (also sometimes called partition into cliques) is the problem of determining whether the vertices of a graph can be partitioned into k cliques.".
- Clique_cover_problem label "Clique cover problem".
- Clique_cover_problem label "Problema di copertura delle cricche".
- Clique_cover_problem label "分團覆蓋問題".
- Clique_cover_problem label "最小クリーク被覆問題".
- Clique_cover_problem sameAs Problema_di_copertura_delle_cricche.
- Clique_cover_problem sameAs 最小クリーク被覆問題.
- Clique_cover_problem sameAs m.0421hlh.
- Clique_cover_problem sameAs Q1096734.
- Clique_cover_problem sameAs Q1096734.
- Clique_cover_problem sameAs Clique_cover_problem.
- Clique_cover_problem wasDerivedFrom Clique_cover_problem?oldid=542928342.
- Clique_cover_problem isPrimaryTopicOf Clique_cover_problem.