Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Athanasios L. Konstantinidis"'
Publikováno v:
WALCOM: Algorithms and Computation ISBN: 9783031270505
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3390f3acfd0a4335beaa7c5b131fd275
https://doi.org/10.1007/978-3-031-27051-2_31
https://doi.org/10.1007/978-3-031-27051-2_31
Publikováno v:
Machine Learning and Knowledge Discovery in Databases ISBN: 9783031263897
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::08369f6203b20dbc0d80838e3192db0b
https://doi.org/10.1007/978-3-031-26390-3_5
https://doi.org/10.1007/978-3-031-26390-3_5
Publikováno v:
Algorithmica. 83:2018-2046
In the Cluster Deletion problem the goal is to remove the minimum number of edges of a given graph, such that every connected component of the resulting graph constitutes a clique. It is known that the decision version of Cluster Deletion is NP-compl
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f88c2368e24eb45127f2059bcd1d64c7
https://doi.org/10.1007/s00453-021-00817-8
https://doi.org/10.1007/s00453-021-00817-8
Publikováno v:
Theoretical Computer Science. 740:76-84
The MaxSTC problem is an assignment of the edges with two types of labels, namely, strong and weak, that maximizes the number of strong edges such that any two vertices that have a common neighbor with a strong edge are adjacent. The Cluster Deletion
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::632d701b923eeaf69cb1e23c1ba5678b
https://doi.org/10.1016/j.tcs.2018.05.012
https://doi.org/10.1016/j.tcs.2018.05.012
Autor:
Athanasios L. Konstantinidis, Petr A. Golovach, Pinar Heggernes, Paloma T. Lima, Charis Papadopoulos
Motivated by the role of triadic closures in social networks, and the importance of finding a maximum subgraph avoiding a fixed pattern, we introduce and initiate the parameterized study of the StrongF-closure problem, where F is a fixed graph. This
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e2e0a54fd72e0964eac471d27308ceb0
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783319623887
COCOON
COCOON
The MaxSTC problem is an assignment of the edges with strong or weak labels having the maximum number of strong edges such that any two vertices that have a common neighbor with a strong edge are adjacent. The Cluster Deletion problem seeks for the m
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::df9cfc8f85630a305268cf65f8ab5b92
https://doi.org/10.1007/978-3-319-62389-4_29
https://doi.org/10.1007/978-3-319-62389-4_29
In social networks the Strong Triadic Closure is an assignment of the edges with strong or weak labels such that any two vertices that have a common neighbor with a strong edge are adjacent. The problem of maximizing the number of strong edges that s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::169545cfa77603dbefd53192aa06e6c2