Sciweavers

Share
25 search results - page 1 / 5
» tcs 2016
Sort
View
TCS
2016
3 years 10 days ago
Unique parallel decomposition in branching and weak bisimulation semantics
We consider the property of unique parallel decomposition modulo branching and weak bisimilarity. First, we show that totally normed behaviours always have parallel decompositions,...
Bas Luttik
TCS
2016
3 years 10 days ago
Games on interval and permutation graph representations
We describe combinatorial games on graphs in which two players antagonistically build a representation of a subgraph of a given graph. We show that for a large class of these game...
Jessica Enright, Lorna Stewart
TCS
2016
3 years 10 days ago
Hardness of computing width parameters based on branch decompositions over the vertex set
Many width parameters of graphs are deļ¬ned using branch decompositions over the vertex set of the graph and a corresponding cut-function. In this paper, we give a general framew...
Sigve Hortemo Sæther, Martin Vatshelle
books