Die maximale Cliquen in einem bipartiten \nGraphen $G$ entsprechen den formalen Begriffen eines Kontext welcher \nIsomorph zu Adjazenzmatrix von $G$ ist. Die Berechnung der Menge der \nformalen Begriffe ist aufw\u00e4ndig. Inwiefern k\u00f6nnen maximale Cliquen einer\n gewissen Gr\u00f6\u00dfe durch heuristische Algorithmen leichter gefunden werden?<\/p>\n\n\n\n
Informationen: Tom Hanika<\/a><\/p>\n","protected":false},"excerpt":{"rendered":" Heuristiken zum Finden maximaler Cliquen Die maximale Cliquen in einem bipartiten Graphen $G$ entsprechen den formalen Begriffen eines Kontext welcher Isomorph zu Adjazenzmatrix von $G$ ist. Die Berechnung der Menge der formalen Begriffe ist aufw\u00e4ndig. Read more…<\/a><\/p>\n","protected":false},"author":8,"featured_media":0,"comment_status":"closed","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[36,34,35],"tags":[39],"class_list":["post-5284","post","type-post","status-publish","format-standard","hentry","category-bachelor","category-methodischer-schwerpunkt","category-technischer-schwerpunkt","tag-ss2019"],"translation":{"provider":"WPGlobus","version":"3.0.2","language":"en","enabled_languages":["de","en"],"languages":{"de":{"title":true,"content":true,"excerpt":false},"en":{"title":false,"content":false,"excerpt":false}}},"_links":{"self":[{"href":"https:\/\/www.kde.cs.uni-kassel.de\/en\/wp-json\/wp\/v2\/posts\/5284","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.kde.cs.uni-kassel.de\/en\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.kde.cs.uni-kassel.de\/en\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.kde.cs.uni-kassel.de\/en\/wp-json\/wp\/v2\/users\/8"}],"replies":[{"embeddable":true,"href":"https:\/\/www.kde.cs.uni-kassel.de\/en\/wp-json\/wp\/v2\/comments?post=5284"}],"version-history":[{"count":2,"href":"https:\/\/www.kde.cs.uni-kassel.de\/en\/wp-json\/wp\/v2\/posts\/5284\/revisions"}],"predecessor-version":[{"id":9445,"href":"https:\/\/www.kde.cs.uni-kassel.de\/en\/wp-json\/wp\/v2\/posts\/5284\/revisions\/9445"}],"wp:attachment":[{"href":"https:\/\/www.kde.cs.uni-kassel.de\/en\/wp-json\/wp\/v2\/media?parent=5284"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.kde.cs.uni-kassel.de\/en\/wp-json\/wp\/v2\/categories?post=5284"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.kde.cs.uni-kassel.de\/en\/wp-json\/wp\/v2\/tags?post=5284"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}