2354 search results - page 330 / 471 » Radio number for trees |
209
click to vote
DISOPT
2010
15 years 6 months ago
2010
While the complexity of min-max and min-max regret versions of most classical combinatorial optimization problems has been thoroughly investigated, there are very few studies abou...
165
click to vote
DAM
2008
15 years 6 months ago
2008
Given an edge- or vertex-weighted graph or digraph and a list of source-sink pairs, the minimum multicut problem consists in selecting a minimum weight set of edges or vertices wh...
165
click to vote
GC
2008
Springer
15 years 6 months ago
2008
Springer
Gioan showed that the number of cycle reversing classes of totally cyclic orientations of a given graph can be calculated as an evaluation of the corresponding Tutte polynomial. We...
151
Voted
JFR
2008
15 years 6 months ago
2008
The usability of mobile robots for surveillance, search and rescue missions can be significantly improved by intelligent functionalities decreasing the cognitive load on the opera...
152
click to vote
JCT
2007
15 years 6 months ago
2007
Abstract. We consider lattice walks in the plane starting at the origin, remaining in the first quadrant i, j ≥ 0 and made of West, South and North-East steps. In 1965, Germain ...