1 citations · 1 across the 2 of their papers we have counts for
2 papers
cs.CC2017★ 1 cited
Being even slightly shallow makes life hard
Irene Muzi, Michael P. O'Brien, Felix Reidl +1
We study the computational complexity of identifying dense substructures, namely -shallow topological minors and -subdivisions. Of particular interest is the case when $r=1…
math.CO2012
Degree-doubling graph families
János Körner, Irene Muzi
Let G be a family of n-vertex graphs of uniform degree 2 with the property that the union of any two member graphs has degree four. We determine the leading term in the asymptotics…