383 search results - page 24 / 77 » A Bound on the Total Chromatic Number |
CCE
2008
13 years 10 months ago
2008
The minimum singular value (MSV) rule is a useful tool for selecting controlled variables (CVs) from the available measurements. However, the application of the MSV rule to large-...
JDA
2006
13 years 10 months ago
2006
Assume that each vertex of a graph G is assigned a nonnegative integer weight and that l and u are nonnegative integers. One wishes to partition G into connected components by del...
ORL
2008
13 years 10 months ago
2008
By analogy with the conjecture of Hirsch, we conjecture that the order of the largest total curvature of the central path associated to a polytope is the number of inequalities de...
CORR
2008
Springer
13 years 10 months ago
2008
Springer
Reachability and distance computation are known to be NL-complete in general graphs, but within UL co-UL if the graphs are planar. However, finding longest paths is known to be N...
COCO
2009
Springer
14 years 5 months ago
2009
Springer
—We study the one-way number-on-the-forhead (NOF) communication complexity of the k-layer pointer jumping problem. Strong lower bounds for this problem would have important impli...