Browse using
OpenLink Faceted Browser
OpenLink Structured Data Editor
LodLive Browser
Formats
RDF:
N-Triples
N3
Turtle
JSON
XML
OData:
Atom
JSON
Microdata:
JSON
HTML
Embedded:
JSON
Turtle
Other:
CSV
JSON-LD
Faceted Browser
Sparql Endpoint
About:
Clique problem
An Entity of Type:
Thing
,
from Named Graph:
http://dbpedia.org
,
within Data Space:
dbpedia-live.demo.openlinksw.com
Computational problem of finding cliques in a graph
Property
Value
dbo:
description
NP-vollständiges Problem der Graphentheorie
(de)
problema legato alla ricerca di particolari sottografi completi in un grafo
(it)
computational problem of finding cliques in a graph
(en)
dbo:
thumbnail
wiki-commons
:Special:FilePath/Brute_force_Clique_algorithm.svg?width=300
dbo:
wikiPageExternalLink
http://4mhz.de/cook.html
http://dimacs.rutgers.edu/Volumes/Vol26.html
http://www.mgvis.com/Papers/MassiveDataSets/Cliques.pdf
https://www.nytimes.com/1990/06/26/science/in-a-frenzy-math-enters-age-of-electronic-mail.html
http://www.renyi.hu/~p_erdos/1935-01.pdf
http://www.csc.kth.se/%7Ejohanh/monotoneclique.pdf
http://www.inf.u-szeged.hu/actacybernetica/edb/vol10n3/pdf/Groger_1992_ActaCybernetica.pdf
http://insilab.org/articles/match2007.pdf
http://insilab.org/maxclique
http://i.stanford.edu/pub/cstr/reports/cs/tr/76/550/CS-TR-76-550.pdf
http://handle.dtic.mil/100.2/ADA247861
http://www.labri.fr/perso/robson/mis/techrep.html
https://hal.inria.fr/hal-00966509
http://research.nii.ac.jp/~uno/papers/04swat.pdf
https://web.archive.org/web/20110629023717/http:/www.cs.berkeley.edu/~luca/cs172/karp.pdf
https://web.archive.org/web/20120527164352/http:/handle.dtic.mil/100.2/ADA247861
https://archive.org/details/discretemathemat0000dmtc/page/278
http://www.cs.berkeley.edu/~luca/cs172/karp.pdf
https://books.google.com/books%3Fid=CAm2DpIqRUIC&pg=PA276
https://digital.library.unt.edu/ark:/67531/metadc1319152/
https://digital.library.unt.edu/ark:/67531/metadc709300/
https://zenodo.org/record/896067
dbo:
wikiPageWikiLink
dbr
:Backtracking
dbr
:Parameterized_complexity
dbr
:Lexicographic_order
dbr
:NC_(complexity)
dbc
:NP-complete_problems
dbr
:Decision_tree_model
dbc
:Computational_problems_in_graph_theory
dbr
:Circle_graph
dbr
:Finite_set
dbr
:Stephen_Cook
dbr
:Glossary_of_graph_theory
dbr
:Undirected_graph
dbr
:NP-completeness
dbr
:P_versus_NP_problem
dbr
:Graph_property
dbr
:Clique_(graph_theory)
dbr
:Maximal_clique
dbr
:Maximum_clique
dbr
:Communications_of_the_ACM
dbr
:Chemistry
dbr
:Adjacency_matrix
dbr
:Karp's_21_NP-complete_problems
dbr
:Journal_of_the_American_Statistical_Association
dbr
:Longest_increasing_subsequence
dbr
:Real_number
dbr
:Closure_(mathematics)
dbr
:Cook–Levin_theorem
dbr
:Matching_(graph_theory)
dbr
:Clique
dbr
:Parallel_algorithm
dbr
:Semidefinite_programming
dbr
:Social_network
dbr
:Many-one_reduction
dbr
:Partial_word
dbr
:Maximum_common_induced_subgraph
dbr
:Big_O_notation
dbr
:Docking_(molecular)
dbr
:Branch_and_bound
dbr
:Complement_graph
dbr
:Kőnig's_theorem_(graph_theory)
dbr
:Protein_structure_prediction
dbr
:Science_(journal)
dbr
:Hypercube
dbr
:Ramsey_theory
dbr
:Fan-in
dbr
:Exponential_time_hypothesis
dbr
:Israel_Journal_of_Mathematics
dbr
:Chordal_graph
dbr
:FP_(complexity)
dbr
:Automatic_test_pattern_generation
dbr
:Circuit_complexity
dbr
:Interval_graph
dbr
:Kuratowski's_theorem
dbr
:Probabilistically_checkable_proof
dbr
:Vertex_(graph_theory)
dbr
:Dependency_graph
dbr
:Algorithm
dbr
:The_New_York_Times
dbr
:Proceedings_of_the_USSR_Academy_of_Sciences
dbr
:Bipartite_graph
dbr
:DNA_computing
dbr
:Chromatic_number
dbr
:Greedy_algorithm
dbr
:Constraint_programming
dbr
:Academic_Press
dbr
:Algorithmica
dbr
:Complete_(complexity)
dbr
:Dense_graph
dbr
:Theoretical_Computer_Science_(journal)
dbr
:Induced_subgraph
dbr
:Computer_science
dbr
:Uriel_Feige
dbr
:Information_Processing_Letters
dbr
:Bioinformatics
dbr
:Truth_value
dbr
:Computational_complexity_theory
dbr
:Complete_graph
dbr
:Boolean_satisfiability_problem
dbr
:American_Mathematical_Society
dbr
:Minor-closed_graph_family
dbr
:Random_graph
dbr
:Maximal_element
dbr
:Unordered_pair
dbr
:Local_search_(optimization)
dbr
:Bulletin_of_the_American_Mathematical_Society
dbr
:Unit_disk_graph
dbr
:DIMACS
dbr
:Acta_Mathematica
dbr
:Approximation_algorithm
dbr
:Erdős–Rényi_model
dbr
:Conjunctive_normal_form
dbr
:Polynomial-time_approximation_scheme
dbr
:Journal_of_the_ACM
dbr
:Journal_of_Combinatorial_Theory
dbr
:Spectral_graph_theory
dbr
:Boxicity
dbr
:Arboricity
dbr
:Discrete_Mathematics_(journal)
dbr
:Wildcard_character
dbr
:Time_complexity
dbr
:Aanderaa–Karp–Rosenberg_conjecture
dbr
:Adiabatic_quantum_computation
dbr
:Hardness_of_approximation
dbr
:IEEE_Transactions_on_Computers
dbr
:Dynamic_programming
dbr
:Brute-force_search
dbr
:Degeneracy_(graph_theory)
dbr
:Edge_(graph_theory)
dbr
:Graph_(discrete_mathematics)
dbr
:Travelling_salesman_problem
dbr
:Computational_chemistry
dbr
:Planar_graph
dbr
:Bron–Kerbosch_algorithm
dbr
:Combinatorica
dbr
:Comparability_graph
dbr
:Compositio_Mathematica
dbr
:Permutation_graph
dbr
:Triangle-free_graph
dbr
:Perfect_graph
dbr
:Symposium_on_Foundations_of_Computer_Science
dbr
:Decision_problem
dbr
:Hereditary_property
dbr
:Discrete_Applied_Mathematics
dbr
:Planted_clique
dbr
:Polynomial_delay
dbr
:Keller's_conjecture
dbr
:Modular_product_of_graphs
dbr
:Journal_of_Computer_and_System_Sciences
dbr
:Springer-Verlag
dbr
:SIAM_Journal_on_Computing
dbr
:SIAM_Journal_on_Discrete_Mathematics
dbr
:Output-sensitive_algorithm
dbr
:Adjacent_(graph_theory)
dbr
:Well-covered_graph
dbr
:NP-complete
dbr
:Polynomial_time
dbr
:Plenum_Publishing_Corporation
dbr
:Exponential_time
dbr
:Linear_time
dbr
:BIT_Numerical_Mathematics
dbr
:Journal_of_Graph_Algorithms_and_Applications
dbr
:Worst-case_analysis
dbr
:Computational_complexity_of_matrix_multiplication
dbr
:NOT_gate
dbr
:Glossary_of_graph_theory_terms
dbr
:Discrete_and_Computational_Geometry
dbr
:Or_gate
dbr
:The_Thomson_Corporation
dbr
:Heuristic_algorithm
dbr
:P_=_NP
dbr
:P_≠_NP
dbr
:File:Sat_reduced_to_Clique_from_Sipser.svg
dbr
:And_gate
dbr
:Evolutionary_tree
dbr
:Proceedings_of_the_National_Academy_of_Sciences
dbr
:Big_omega_notation
dbr
:Big_theta_notation
dbr
:Lexicographic_ordering
dbr
:File:6n-graf-clique.svg
dbr
:File:Brute_force_Clique_algorithm.svg
dbr
:File:Cube-face-intersection-graph.svg
dbr
:File:Decision_tree_for_3-clique_no_arrowheads.svg
dbr
:File:Monotone_circuit_for_3-clique.svg
dbr
:File:Permutation_graph.svg
dbr
:Decision_tree_complexity
dbr
:Neighborhood_(graph_theory)
dbr
:W(1)
dbr
:Approximation_ratio
dbr
:Complement_(graph_theory)
dbr
:Independent_set_problem
dbr
:Information_and_Control
dbr
:Systematic_Zoology
dbr
:Truth_values
dbp:
wikiPageUsesTemplate
dbt
:Good_article
dbt
:Main
dbt
:Reflist
dbt
:Math
dbt
:Clear
dbt
:Doi
dbt
:Radic
dbt
:Citation
dbt
:Refend
dbt
:Sfnp
dbt
:Refbegin
dbt
:Italics_correction
dbt
:Mvar
dbt
:ECCC
dbt
:Harvtxt
dbt
:Short_description
dct:
subject
dbc
:NP-complete_problems
dbc
:Computational_problems_in_graph_theory
rdfs:
label
Clique problem
(en)
مشكلة المخطط الكامل ضمن مخطط
(ar)
Cliquenproblem
(de)
Problema del clique
(es)
Problème de la clique
(fr)
Problema della cricca
(it)
最大クリーク問題
(ja)
클릭 문제
(ko)
Problem kliki
(pl)
Problema do clique
(pt)
Задача про кліку
(uk)
Задача о клике
(ru)
分團問題
(zh)
owl:
sameAs
yago-res
:Clique problem
freebase
:Clique problem
wikidata
:Clique problem
dbpedia-it
:Clique problem
dbpedia-de
:Clique problem
dbpedia-fr
:Clique problem
dbpedia-zh
:Clique problem
dbpedia-ja
:Clique problem
dbpedia-pt
:Clique problem
dbpedia-ro
:Clique problem
dbpedia-es
:Clique problem
dbpedia-ru
:Clique problem
dbpedia-pl
:Clique problem
dbpedia-ko
:Clique problem
dbpedia-ar
:Clique problem
dbpedia-bn
:Clique problem
dbpedia-sr
:Clique problem
dbpedia-th
:Clique problem
dbpedia-uk
:Clique problem
dbpedia-global
:Clique problem
dbr
:Clique problem
prov:
wasDerivedFrom
wikipedia-en
:Clique_problem?oldid=1292959072&ns=0
foaf:
depiction
wiki-commons
:Special:FilePath/Sat_reduced_to_Clique_from_Sipser.svg
wiki-commons
:Special:FilePath/Permutation_graph.svg
wiki-commons
:Special:FilePath/6n-graf-clique.svg
wiki-commons
:Special:FilePath/Brute_force_Clique_algorithm.svg
wiki-commons
:Special:FilePath/Cube-face-intersection-graph.svg
wiki-commons
:Special:FilePath/Decision_tree_for_3-clique_no_arrowheads.svg
wiki-commons
:Special:FilePath/Monotone_circuit_for_3-clique.svg
wiki-commons
:Special:FilePath/Planted_clique_15,32.svg
foaf:
isPrimaryTopicOf
wikipedia-en
:Clique_problem
is
dbo:
wikiPageDisambiguates
of
dbr
:Clique_(disambiguation)
is
dbo:
wikiPageRedirects
of
dbr
:K-clique_problem
dbr
:Maximum_clique_problem
dbr
:Approximation_algorithms_for_the_clique_problem
is
dbo:
wikiPageWikiLink
of
dbr
:List_of_computability_and_complexity_topics
dbr
:HCS_clustering_algorithm
dbr
:Pairwise_compatibility_graph
dbr
:NP-completeness
dbr
:Clique_(graph_theory)
dbr
:Coenraad_Bron
dbr
:Karp's_21_NP-complete_problems
dbr
:List_of_NP-complete_problems
dbr
:Longest_increasing_subsequence
dbr
:List_of_terms_relating_to_algorithms_and_data_structures
dbr
:Clique_(disambiguation)
dbr
:Vertex_cover
dbr
:Independent_set_(graph_theory)
dbr
:Partial_word
dbr
:Maximum_common_induced_subgraph
dbr
:Combinatorial_optimization
dbr
:Isolation_lemma
dbr
:Circuit_complexity
dbr
:Point-set_registration
dbr
:Graph_theory
dbr
:Graph_coloring
dbr
:Subgraph_isomorphism_problem
dbr
:Cograph
dbr
:Induced_subgraph
dbr
:Hall_violator
dbr
:The_Art_of_Computer_Programming
dbr
:Boolean_satisfiability_problem
dbr
:Maximal_independent_set
dbr
:Approximation_algorithm
dbr
:Set_packing
dbr
:Graph_isomorphism_problem
dbr
:List_of_graph_theory_topics
dbr
:List_of_mathematical_proofs
dbr
:Time_complexity
dbr
:Dedekind–MacNeille_completion
dbr
:Bron–Kerbosch_algorithm
dbr
:Permutation_graph
dbr
:Dense_subgraph
dbr
:Bounded_expansion
dbr
:Logic_of_graphs
dbr
:Planted_clique
dbr
:Matroid_parity_problem
dbr
:Keller's_conjecture
dbr
:Modular_product_of_graphs
dbr
:Word-representable_graph
dbr
:Tolerance_graph
dbr
:Quadratic_knapsack_problem
dbr
:Geodetic_graph
dbr
:Genome_architecture_mapping
dbr
:MaxCliqueDyn_maximum_clique_algorithm
dbr
:Enumeration_algorithm
dbr
:K-clique_problem
dbr
:Maximum_clique_problem
dbr
:Approximation_algorithms_for_the_clique_problem
is
dbp:
data
of
dbr
:MaxCliqueDyn_algorithm
is
foaf:
primaryTopic
of
wikipedia-en
:Clique_problem
This content was extracted from
Wikipedia
and is licensed under the
Creative Commons Attribution-ShareAlike 4.0 International