Sciweavers

725 search results - page 28 / 145
» Bounding Degrees on RPL
Sort
View
81
Voted
WEA
2007
Springer
158views Algorithms» more  WEA 2007»
15 years 3 months ago
A Primal Branch-and-Cut Algorithm for the Degree-Constrained Minimum Spanning Tree Problem
The degree-constrained minimum spanning tree (DCMST) is relevant in the design of networks. It consists of finding a spanning tree whose nodes do not exceed a given maximum degree...
Markus Behle, Michael Jünger, Frauke Liers
COMBINATORICS
2007
75views more  COMBINATORICS 2007»
14 years 9 months ago
Maximal Projective Degrees for Strict Partitions
Let λ be a partition, and denote by fλ the number of standard tableaux of shape λ. The asymptotic shape of λ maximizing fλ was determined in the classical work of Logan and S...
D. Bernstein, A. Henke, A. Regev
EJC
2008
14 years 9 months ago
Grad and classes with bounded expansion III. Restricted graph homomorphism dualities
We study restricted homomorphism dualities in the context of classes with bounded expansion. This presents a generalization of restricted dualities obtained earlier for bounded deg...
Jaroslav Nesetril, Patrice Ossona de Mendez
ADCM
2008
119views more  ADCM 2008»
14 years 8 months ago
Bounds on the dimensions of trivariate spline spaces
We derive upper and lower bounds on the dimensions of trivariate spline spaces defined on tetrahedral partitions. The results hold for general partitions, and for all degrees of sm...
Peter Alfeld, Larry L. Schumaker
CDC
2010
IEEE
133views Control Systems» more  CDC 2010»
14 years 4 months ago
Robustness of funnel control in the gap metric
For m-input, m-output, finite-dimensional, linear systems satisfying the classical assumptions of adaptive control (i.e., (i) minimum phase, (ii) relative degree one and (iii) pos...
Achim Ilchmann, Markus Mueller