1986 search results - page 285 / 398 » Path Separability of Graphs |
135
click to vote
STACS
2007
Springer
15 years 8 months ago
2007
Springer
An orthogonal spanner network for a given set of n points in the plane is a plane straight line graph with axis-aligned edges that connects all input points. We show that for any ...
117
Voted
WEA
2007
Springer
15 years 8 months ago
2007
Springer
Dynamic tree data structures maintain forests that change over time through edge insertions and deletions. Besides maintaining connectivity information in logarithmic time, they ca...
119
click to vote
ISSRE
2006
IEEE
15 years 8 months ago
2006
IEEE
Practical model validation techniques are needed for model driven development (MDD) techniques to succeed. This paper presents an approach to generating inputs to test UML design ...
117
click to vote
ICDM
2005
IEEE
15 years 8 months ago
2005
IEEE
We consider the problem of elastic matching of time series. We propose an algorithm that determines a subsequence of a target time series that best matches a query series. In the ...
139
click to vote
LCPC
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. A fundamental problem in the analysis of parallel programs is to determine when two statements in a program may run concurrently. This analysis is the parallel analog to ...