1729 search results - page 248 / 346 » On Bounds for the k-Partitioning of Graphs |
164
click to vote
COCO
2010
Springer
15 years 10 months ago
2010
Springer
The last decade has seen a revival of interest in pebble games in the context of proof complexity. Pebbling has proven to be a useful tool for studying resolution-based proof syst...
213
click to vote
ICALP
2009
Springer
16 years 6 months ago
2009
Springer
Abstract. This paper deals with approximations of maximum independent sets in non-uniform hypergraphs of low degree. We obtain the first performance ratio that is sublinear in term...
167
click to vote
IWPEC
2009
Springer
16 years 26 days 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...
186
click to vote
ICDCS
2008
IEEE
16 years 23 days 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...
144
click to vote
FCT
2005
Springer
15 years 12 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...