Showing 2021Show all
2 papers · 1 filter
cs.DS2021
A Unifying Framework for Characterizing and Computing Width Measures
Eduard Eiben, Robert Ganian, Thekla Hamm +2
Algorithms for computing or approximating optimal decompositions for decompositional parameters such as treewidth or clique-width have so far traditionally been tailored to specifi…
cs.DS2021
Valued Authorization Policy Existence Problem: Theory and Experiments
Jason Crampton, Eduard Eiben, Gregory Gutin +2
Recent work has shown that many problems of satisfiability and resiliency in workflows may be viewed as special cases of the authorization policy existence problem (APEP), which re…