10 citations · 48 across the 37 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2018
On Reachability Mixed Arborescence Packing
Tatsuya Matsuoka, Shin-ichi Tanigawa
As a generalization of the Edmonds arborescence packing theorem, Kamiyama--Katoh--Takizawa (2009) gave a good characterization of directed graphs that contain arc-disjoint arboresc…
cs.DM2017★ 2 cited
A Structural Characterization for Certifying Robinsonian Matrices
Monique Laurent, Matteo Seminaroti, Shin-ichi Tanigawa
A symmetric matrix is Robinsonian if its rows and columns can be simultaneously reordered in such a way that entries are monotone nondecreasing in rows and columns when moving towa…