323 search results - page 26 / 65 » Dualizability and graph algebras |
GC
2008
Springer
13 years 7 months ago
2008
Springer
In this paper we study the class of weakly quasi-threshold graphs that are obtained from a vertex by recursively applying the operations (i) adding a new isolated vertex, (ii) addi...
CONCUR
2006
Springer
13 years 11 months ago
2006
Springer
We propose the notions of "density" and "connectivity" of infinite process graphs and investigate them in the context of the wellknown process algebras BPA and ...
CDC
2010
IEEE
13 years 2 months ago
2010
IEEE
The study focuses on a class of discrete-time multi-agent systems modelling opinion dynamics with decaying confidence. Essentially, we propose an agreement protocol that impose a p...
LION
2009
Springer
14 years 2 months ago
2009
Springer
Graph partitioning is a well-known optimization problem of great interest in theoretical and applied studies. Since the 1990s, many multilevel schemes have been introduced as a pra...
STACS
2010
Springer
13 years 11 months ago
2010
Springer
We completely characterise the computational complexity of the list homomorphism problem for graphs in combinatorial and algebraic terms: for every graph H the problem is either N...