research
∙
08/21/2023
Computing Optimal Leaf Roots of Chordal Cographs in Linear Time
A graph G is a k-leaf power, for an integer k >= 2, if there is a tree T...
share
research
∙
06/10/2018
Towards Completely Characterizing the Complexity of Boolean Nets Synthesis
Boolean nets are Petri nets that permit at most one token per place. Res...
research
∙
11/01/2017
