3757 search results - page 570 / 752 » The overlap number of a graph |
158
click to vote
CPM
2001
Springer
15 years 11 months ago
2001
Springer
In 1995, Hannenhalli and Pevzner gave a first polynomial solution to the problem of finding the minimum number of reversals needed to sort a signed permutation.Their solution, a...
134
click to vote
DEXA
2001
Springer
15 years 11 months ago
2001
Springer
In this paper we investigate various aspects of representing multidimensional information in the frame of the WWW. Multidimensional XML (MXML) is an extension of XML suitable for r...
167
click to vote
FSTTCS
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. This paper addresses the state explosion problem in automata based LTL model checking. To deal with large space requirements we turn to use a distributed approach. All th...
196
click to vote
IDEAS
2000
IEEE
15 years 11 months ago
2000
IEEE
I n this paper, we address the problem of query processing o n distributed semi-structured data. The distributed semistructured data can be modeled as a rooted and edge-labeled gr...
184
click to vote
COCOON
2000
Springer
15 years 10 months ago
2000
Springer
We consider the parameterized complexity of the following problem under the framework introduced by Downey and Fellows[4]: Given a graph G, an integer parameter k and a non-trivial...