3652 search results - page 66 / 731 » A study of query length |
ICALP
2010
Springer
13 years 11 months ago
2010
Springer
We present an O(m + n)-time algorithm that tests if a given directed graph is 2-vertex connected, where m is the number of arcs and n is the number of vertices. Based on this resul...
CCCG
2006
13 years 9 months ago
2006
We study the relationship between the interior angles of a convex polygon and the lengths of external watchman routes.
DCC
2010
IEEE
13 years 8 months ago
2010
IEEE
This paper introduces and studies the notion of an equidistant frequency permutation array (EFPA). An EFPA of length n = m, distance d and size v is defined to be a v
DAM
2008
13 years 8 months ago
2008
Recently, Stanley [13] studied the length of the longest alternating subsequence of a permutation in the symmetric group, where a sequence a, b, c, d, . . . is alternating if a &g...
IPL
2008
13 years 7 months ago
2008
Abstract. In this paper, we study a restricted version of the position restricted pattern matching problem introduced and studied M