Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Bombina, Polina"'
Autor:
Bombina, Polina1 (AUTHOR) pbombina@augusta.edu, Tally, Dwayne2 (AUTHOR), Abrams, Zachary B.3 (AUTHOR), Coombes, Kevin R.1 (AUTHOR)
Publikováno v:
PLoS ONE. 6/7/2024, Vol. 19 Issue 6, p1-17. 17p.
Autor:
Bombina, Polina, Ames, Brendan
We consider the densest $k$-subgraph problem, which seeks to identify the $k$-node subgraph of a given input graph with maximum number of edges. This problem is well-known to be NP-hard, by reduction to the maximum clique problem. We propose a new co
Externí odkaz:
http://arxiv.org/abs/1904.03272
