13603 search results - page 415 / 2721 » On the Complexity of Computing Treelength |
176
click to vote
FCT
2009
Springer
16 years 2 months ago
2009
Springer
In social network theory, a simple graph G is called k-role assignable if there is a surjective mapping that assigns a number from {1, . . . , k} called a role to each vertex of G ...
196
click to vote
ECAL
2007
Springer
16 years 1 months ago
2007
Springer
The Bare Bones language is a programming language with a minimal set of operations that exhibits universal computation. We present a conceptual framework, Chemical Bare Bones, to c...
177
click to vote
CSFW
2005
IEEE
16 years 1 months ago
2005
IEEE
We consider expansions of the Abadi-Rogaway logic of indistinguishability of formal cryptographic expressions. We expand the logic in order to cover cases when partial information...
217
click to vote
WG
2005
Springer
16 years 1 months ago
2005
Springer
In this paper, we present a new algorithm for computing the chromatic polynomial of a general graph G. Our method is based on the addition of edges and contraction of non-edges of ...
197
click to vote
HUC
2004
Springer
16 years 1 months ago
2004
Springer
As ubiquitous computing technologies mature, they must move out of laboratory settings and into the everyday world. In the process, they will increasingly be used by heterogeneous ...