4315 search results - page 43 / 863 » Sorting in linear time |
IWPEC
2004
Springer
14 years 29 days ago
2004
Springer
Let G = V; E be a graph. The linear-width of G is de ned as the smallest integer k such that E can be arranged in a linear ordering e1; : : : ; er such that for every i = 1; :...
ESOP
2010
Springer
14 years 5 months ago
2010
Springer
ICDM
2009
IEEE
13 years 5 months ago
2009
IEEE
The design of a good kernel is fundamental for knowledge discovery from graph-structured data. Existing graph kernels exploit only limited information about the graph structures bu...
DEDS
2007
13 years 7 months ago
2007
This paper deals with just in time control of (max, +)-linear systems. The output tracking problem, considered in previous studies, is generalized by considering additional constr...
DM
2007
13 years 7 months ago
2007
We present an algorithm that determines the prime factors of connected graphs with respect to the Cartesian product in linear time and space. This improves a result of Aurenhammee...