Iskanje po repozitoriju

Strong cliques in diamond-free graphs
Nina Chiarelli, Berenice Martínez-Barona, Martin Milanič, Jérôme Monnot, Peter Muršič, 2020, izvirni znanstveni članek

Ključne besede: maximal clique, maximal stable set, diamond-free graph, strong clique, simplicial clique, strongly perfect graph, CIS graph, NP-hard problem, polynomial-time algorithm, Erdős-Hajnal property
Objavljeno v RUP: 17.12.2020; Ogledov: 4564; Prenosov: 164
Povezava na celotno besedilo

Generalizations of simplicial vertices and a new polynomially solvable case of the maximum weight clique problem, National Research University Higher School of Economics, Faculty of Computer Science, Moscow, 21. 8. 19
Martin Milanič, 2019, predavanje na tuji univerzi

Ključne besede: simplicial vertex, avoidable vertex, maximum weight clique problem, polynomial-time algorithm, hole-cyclically orientable graph
Objavljeno v RUP: 03.09.2019; Ogledov: 3667; Prenosov: 20
Povezava na celotno besedilo

Ligand-protein binding and ligand-based virtual screening using maximum clique algorithm
Dušanka Janežič, Janez Konc, 2015, objavljeni povzetek znanstvenega prispevka na konferenci

Ključne besede: ligand-protein binding, virtual screening, clique algorithm
Objavljeno v RUP: 08.08.2016; Ogledov: 5258; Prenosov: 47
Povezava na celotno besedilo