Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Valentin Rohm"'
Covering all edges of a graph by a small number of vertices, this is the NP-complete Vertex Cover problem. It is among the most fundamental graph-algorithmic problems. Following a recent trend in studying temporal graphs (a sequence of graphs, so-cal
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::75fd11391e6afe7250a75126c25ef384
http://arxiv.org/abs/1906.00659
http://arxiv.org/abs/1906.00659
