2283 search results - page 275 / 457 » Bounds of Graph Characteristics |
132
click to vote
IWPEC
2009
Springer
15 years 10 months ago
2009
Springer
We describe a framework for expressing the complexity of algorithms for FPT problems with two separate parameters k, m and with exponential time bounds O∗ (xk ym ) where x, y &g...
143
Voted
ICDCS
2008
IEEE
15 years 10 months ago
2008
IEEE
— Relative neighborhood graph (RNG) has been widely used in topology control and geographic routing in wireless ad hoc networks. Its maximum edge length is the minimum requiremen...
112
Voted
FCT
2005
Springer
15 years 9 months ago
2005
Springer
We present an algorithm which calculates a minimum cut and its weight in an undirected graph with nonnegative real edge weights, n vertices and m edges, in time O( ` max (log n, mi...
120
Voted
POPL
2000
ACM
15 years 7 months ago
2000
ACM
In 1998 Asperti and Mairson proved that the cost of reducing a lambda-term using an optimal lambda-reducer (a la L´evy) cannot be bound by any elementary function in the number o...
146
Voted
IPPS
1999
IEEE
15 years 7 months ago
1999
IEEE
We propose the recursive grid layout scheme for deriving efficient layouts of a variety of hierarchical networks and computing upper bounds on the VLSI area of general hierarchica...