1963 search results - page 92 / 393 » The Maximum Solution Problem on Graphs |
CDC
2010
IEEE
13 years 5 months ago
2010
IEEE
This work deals with trajectory optimization for a network of robotic sensors sampling a spatio-temporal random field. We examine the problem of minimizing over the space of networ...
CORR
2008
Springer
13 years 10 months ago
2008
Springer
Abstract. We discuss the problem of determining the complete weight hierarchy of linear error correcting codes associated to Grassmann varieties and, more generally, to Schubert va...
ECCC
2006
13 years 10 months ago
2006
We present two new methods for finding a lowest common ancestor (LCA) for each pair of vertices of a directed acyclic graph (dag) on n vertices and m edges. The first method is su...
ISAAC
2009
Springer
14 years 4 months ago
2009
Springer
We give a simple framework which is an alternative to the celebrated and widely used shifting strategy of Hochbaum and Maass [J. ACM, 1985] which has yielded efficient algorithms ...
AAIM
2007
Springer
14 years 4 months ago
2007
Springer
An acyclic edge colouring of a graph is a proper edge colouring having no 2-coloured cycle, that is, a colouring in which the union of any two colour classes forms a linear forest...