127
click to vote
MFCS
15 years 5 months ago
2009 Springer 
We present a simple algorithm for the maximum spanning star forest problem. We take advantage of the fact that the problem is a special case of complementary set cover and we adapt...
110
Voted
MFCS
15 years 7 months ago
2009 Springer 
We study visibly pushdown automata (VPA) models for expressing and evaluating queries, expressed using MSO formulas, on words with a nesting structure (like XML documents). We deļ...
117
click to vote
MFCS
15 years 7 months ago
2009 Springer
We investigate the computational complexity of a general ācompression taskā centrally occurring in the recently developed technique of iterative compression for exactly solving...
111
click to vote
MFCS
15 years 7 months ago
2009 Springer 
Abstract. The description of a single state of a modelled system is often complex in practice, but few procedures for synthesis address this problem in depth. We study systems in w...
96
Voted
MFCS
15 years 5 months ago
2009 Springer
In this paper we ļ¬rst explore the group theoretic techniques developed for graph isomorphism. We speciļ¬cally discuss the techniques developed by Luks for solving constrained v...
|
Theoretical Computer Science