332 search results - page 2 / 67 » Compositions of Graphs Revisited |
ENTCS
2010
13 years 2 months ago
2010
A previously introduced combination of the bialgebraic approach to structural operational semantics with aic modal logic is re-examined and improved in some aspects. Firstly, a mo...
SEW
2007
IEEE
13 years 11 months ago
2007
IEEE
We revisit the automatic tool composition feature of the Electronic Tool Integration platform under the perspective of planning. It turns out that in todays terminology, ETIs temp...
TCC
2010
Springer
13 years 3 months ago
2010
Springer
We revisit the composability of different forms of zero-knowledge proofs when the honest prover strategy is restricted to be polynomial time (given an appropriate auxiliary input)...
ALGORITHMICA
2004
13 years 5 months ago
2004
Eppstein [5] characterized the minor-closed graph families for which the treewidth is bounded by a function of the diameter, which includes e.g. planar graphs. This characterizatio...
PVLDB
2010
13 years 3 months ago
2010
In a variety of emerging applications one needs to decide whether a graph G matches another Gp, i.e., whether G has a topological structure similar to that of Gp. The traditional ...