288 search results - page 58 / 58 » Linearly bounded infinite graphs |
146
click to vote
FSTTCS
2009
Springer
15 years 10 months ago
2009
Springer
A tournament T = (V, A) is a directed graph in which there is exactly one arc between every pair of distinct vertices. Given a digraph on n vertices and an integer parameter k, th...
161
click to vote
DAM
2011
14 years 10 months ago
2011
Partial words, which are sequences that may have some undefined positions called holes, can be viewed as sequences over an extended alphabet A = A ∪ { }, where stands for a hol...
146
Voted
JCST
2007
15 years 3 months ago
2007
Abstract Advances in wireless sensor networks and positioning technologies enable new applications monitoring moving objects. Some of these applications, such as traffic managemen...