47 citations · 159 across the 27 of their papers we have counts for
1 paper · 1 filter
Mikolaj Bojanczyk
We describe two formalisms for defining graph languages, and prove that they are equivalent: 1. Separator logic. This is first-order logic on graphs which is allowed to use the edg…