8 citations · 13 across the 7 of their papers we have counts for
1 paper · 2 filters
Jesse Beisegel, Ekkehard Köhler, Fabienne Ratajczak +2
The last in-tree recognition problem asks whether a given spanning tree can be derived by connecting each vertex with its rightmost left neighbor of some search ordering. In this s…