1729 search results - page 153 / 346 » On Bounds for the k-Partitioning of Graphs |
183
click to vote
EPEW
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. The adequate system performance is usually a critical requirement to be checked during the verification phase of a system. Thus, accurately measuring the performance of c...
151
click to vote
IPL
2006
15 years 6 months ago
2006
: In this paper we consider the vertex ranking problem of weighted trees. We show that this problem is strongly NP-hard. We also give a polynomial-time reduction from the problem o...
174
click to vote
CORR
2008
Springer
15 years 6 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...
159
click to vote
TCS
2008
15 years 6 months ago
2008
The replication number of a branching program is the minimum number R such that along every accepting computation at most R variables are tested more than once; the sets of variab...
153
click to vote
DCC
2008
IEEE
16 years 6 months ago
2008
IEEE
Some improved bounds on the number of directions not determined by a point set in the affine space AG(k, q) are presented. More precisely, if there are more than pe (q -1) directio...