1 citations · 1 across the 1 of their papers we have counts for
1 paper
Dan Alden Baterisna, Yi-Jun Chang
We present proof labeling schemes for graphs with bounded pathwidth that can decide any graph property expressible in monadic second-order (MSO) logic using O(logn)-bit vertex…