Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

94

COCOON
1999
Springer

131views Combinatorics» more COCOON 1999»

On Bounds for the k-Partitioning of Graphs

15 years 7 months ago

On Bounds for the k-Partitioning of Graphs

Download mcs.uwsuper.edu

Sergei L. Bezrukov, Robert Elsässer, Ulf-Pete

Real-time Traffic

COCOON 1999 | Combinatorics |

claim paper

Related Content

» On the Inapproximability of Vertex Cover on kPartite kUniform Hypergraphs

» ResourceBounded Information Gathering for Correlation Clustering

» A Sublinear Bipartiteness Tester for Bounded Degree Graphs

» On Testing Expansion in BoundedDegree Graphs

» A Partial kArboretum of Graphs with Bounded Treewidth

» Spectral radius of finite and infinite planar graphs and of graphs of bounded genus

» An improved bound on the largest induced forests for trianglefree planar graphs

» Parity Games with Partial Information Played on Graphs of Bounded Complexity

» On the genus of pancake network

Post Info
More Details (n/a)

Added	03 Aug 2010
Updated	03 Aug 2010
Type	Conference
Year	1999
Where	COCOON
Authors	Sergei L. Bezrukov, Robert Elsässer, Ulf-Peter Schroeder

Comments (0)