5 citations · 23 across the 20 of their papers we have counts for
Showing 2013Show all
2 papers · 1 filter
cs.DS2013
Large induced subgraphs via triangulations and CMSO
Fedor Fomin, Ioan Todinca, Yngve Villanger
We obtain an algorithmic meta-theorem for the following optimization problem. Let ϕ be a Counting Monadic Second Order Logic (CMSO) formula and t be an integer. For a given graph G…
cs.DS2013★ 1 cited
TREEWIDTH and PATHWIDTH parameterized by vertex cover
Mathieu Chapelle, Mathieu Liedloff, Ioan Todinca +1
After the number of vertices, Vertex Cover is the largest of the classical graph parameters and has more and more frequently been used as a separate parameter in parameterized prob…