-approximation algorithm for maximum independent set of connected subgraphs in a planar graph.

Jana Cslovjecsek Michal Pilipczuk Karol Wegrzycki

Published in: CoRR (2023)

Keyphrases

computational complexity
connected subgraphs
np hard
worst case
simulated annealing
closed form
planar graphs
social networks
graphical models