Quick but Odd Growth of Cacti
Sign Up to like & getrecommendations! Published in 2017 at "Algorithmica"
DOI: 10.1007/s00453-017-0317-1
Abstract: Let $${\mathcal {F}}$$F be a family of graphs. Given an n-vertex input graph G and a positive integer k, testing whether G has a vertex subset S of size at most k, such that $$G-S$$G-S… read more here.
Keywords: odd cacti; family; quick odd; growth cacti ... See more keywords