144
click to vote
FSTTCS
15 years 6 months ago
2001 Springer 
Consider a directed graph G = (V, E) with n vertices and a root vertex r ∈ V . The DMDST problem for G is one of constructing a spanning tree rooted at r, whose maximal degree is...
131
click to vote
FSTTCS
15 years 6 months ago
2001 Springer 
Abstract. We propose a novel approach to clustering, based on deterministic analysis of random walks on the weighted graph associated with the clustering problem. The method is cen...
132
click to vote
FSTTCS
15 years 6 months ago
2001 Springer
Abstract. Regular Model-Checking (RMC) is a technique for the formal verification of infinite state systems based on the theory of regular languages. In the paper “Beyond Regul...
FSTTCS
15 years 6 months ago
2001 Springer 
For any class C und closed under NC1 reductions, it is shown that all sets complete for C under first-order (equivalently, Dlogtimeuniform AC0 ) reductions are isomorphic under ...
FSTTCS
15 years 6 months ago
2001 Springer 
Abstract. In [12] we started a research on a distributed-timed extension of Petri nets where time parameters are associated with tokens and arcs carry constraints that qualify the ...
|
Software Engineering