4 citations · 12 across the 12 of their papers we have counts for
3 papers · 1 filter
Transversals of Longest Paths
Márcia R. Cerioli, Cristina G. Fernandes, Renzo Gómez +2
Let $\lpt(G)$ be the minimum cardinality of a set of vertices that intersects all longest paths in a graph . Let be the size of a maximum clique in , and $\tw(G)$ be t…
Finding Connected Secluded Subgraphs
Petr A. Golovach, Pinar Heggernes, Paloma Lima +1
Problems related to finding induced subgraphs satisfying given properties form one of the most studied areas within graph algorithms. Such problems have given rise to breakthrough…
Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2
Petr A. Golovach, Pinar Heggernes, Dieter Kratsch +2
Deciding whether a given graph has a square root is a classical problem that has been studied extensively both from graph theoretic and from algorithmic perspectives. The problem i…