This HTML5 document contains 52 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
yago-reshttp://yago-knowledge.org/resource/
dbohttp://dbpedia.org/ontology/
n7http://insilab.org/maxclique/
n17http://dbpedia.org/resource/File:
foafhttp://xmlns.com/foaf/0.1/
n18https://global.dbpedia.org/id/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
n6http://commons.wikimedia.org/wiki/Special:FilePath/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
wikipedia-enhttp://en.wikipedia.org/wiki/
dbphttp://dbpedia.org/property/
provhttp://www.w3.org/ns/prov#
dbchttp://dbpedia.org/resource/Category:
xsdhhttp://www.w3.org/2001/XMLSchema#
wikidatahttp://www.wikidata.org/entity/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:ProBiS
dbo:wikiPageWikiLink
dbr:MaxCliqueDyn_maximum_clique_algorithm
Subject Item
dbr:List_of_algorithms
dbo:wikiPageWikiLink
dbr:MaxCliqueDyn_maximum_clique_algorithm
Subject Item
dbr:LiSiCA
dbo:wikiPageWikiLink
dbr:MaxCliqueDyn_maximum_clique_algorithm
Subject Item
dbr:MaxCliqueDyn_maximum_clique_algorithm
rdfs:label
MaxCliqueDyn maximum clique algorithm
rdfs:comment
The MaxCliqueDyn algorithm is an algorithm for finding a maximum clique in an undirected graph. It is based on a basic algorithm (MaxClique algorithm) which finds a maximum clique of bounded size. The bound is found using improved coloring algorithm. The MaxCliqueDyn extends MaxClique algorithm to include dynamically varying bounds. This algorithm was designed by and description was published in 2007. In comparison to earlier algorithms described in the published article the MaxCliqueDyn algorithm is improved by an improved approximate coloring algorithm and by applying tighter, more computationally expensive upper bounds on a fraction of the search space. Both improvements reduce time to find maximum clique. In addition to reducing time improved coloring algorithm also reduces the nu
foaf:depiction
n6:Example_MaxCliqueDyn.png n6:MaxCliqueDyn_logo.png
dcterms:subject
dbc:Articles_with_example_pseudocode dbc:Graph_algorithms
dbo:wikiPageID
51484735
dbo:wikiPageRevisionID
976995798
dbo:wikiPageWikiLink
dbr:Graph_theory dbr:Maximum_clique_algorithm dbr:Algorithm dbr:Clique_problem dbr:Janez_Konc dbr:GNU_General_Public_License dbc:Articles_with_example_pseudocode dbc:Graph_algorithms dbr:C++ n17:Example_MaxCliqueDyn.png n17:MaxCliqueDyn_logo.png dbr:ColorSort_algorithm
dbo:wikiPageExternalLink
n7:
owl:sameAs
wikidata:Q28446854 yago-res:MaxCliqueDyn_maximum_clique_algorithm n18:2eDkD
dbp:wikiPageUsesTemplate
dbt:Infobox dbt:Reflist
dbo:thumbnail
n6:MaxCliqueDyn_logo.png?width=300
dbp:data
Active dbr:C++ n7: dbr:GNU_General_Public_License Insilab dbr:Clique_problem dbr:Graph_theory dbr:Maximum_clique_algorithm
dbp:label
Website: Developers: Development status: License: Written in: Type:
dbp:headerstyle
background: #DD9
dbp:labelstyle
font-weight:bold
dbo:abstract
The MaxCliqueDyn algorithm is an algorithm for finding a maximum clique in an undirected graph. It is based on a basic algorithm (MaxClique algorithm) which finds a maximum clique of bounded size. The bound is found using improved coloring algorithm. The MaxCliqueDyn extends MaxClique algorithm to include dynamically varying bounds. This algorithm was designed by and description was published in 2007. In comparison to earlier algorithms described in the published article the MaxCliqueDyn algorithm is improved by an improved approximate coloring algorithm and by applying tighter, more computationally expensive upper bounds on a fraction of the search space. Both improvements reduce time to find maximum clique. In addition to reducing time improved coloring algorithm also reduces the number of steps needed to find a maximum clique.
dbp:abovestyle
background: #DD9
prov:wasDerivedFrom
wikipedia-en:MaxCliqueDyn_maximum_clique_algorithm?oldid=976995798&ns=0
dbo:wikiPageLength
9735
foaf:isPrimaryTopicOf
wikipedia-en:MaxCliqueDyn_maximum_clique_algorithm
Subject Item
wikipedia-en:MaxCliqueDyn_maximum_clique_algorithm
foaf:primaryTopic
dbr:MaxCliqueDyn_maximum_clique_algorithm