20.500.12556/RUP-14671 Strong cliques in diamond-free graphs 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 maksimalna klika maksimalna neodvisna množica graf brez diamantov krepka klika simplicialna klika krepko popoln graf CIS graf NP-težek problem polinomski algoritem lastnost Erdősa in Hajnala true true false Angleški jezik Angleški jezik Neznano 2020-12-17 12:06:42 2020-12-17 12:06:43 2024-03-01 14:16:58 0000-00-00 00:00:00 2020 0 0 str. 1-22 2020 0000-00-00 NiDoloceno NiDoloceno NiDoloceno 0000-00-00 0000-00-00 0000-00-00 519.17 0304-3975 26525952 10.1016/j.tcs.2020.12.001 42440451 https://www.sciencedirect.com/science/article/abs/pii/S0304397520307088?via%3Dihub 1 https://repozitorij.upr.si/Dokument.php?lang=slv&id=21678 Inštitut Andrej Marušič 0 0 0