Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
17
click to vote
COCOON
1999
Springer
favorite
Email
discuss
report
131
views
Combinatorics
»
more
COCOON 1999
»
On Bounds for the k-Partitioning of Graphs
14 years 25 days ago
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
more »
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)
Researcher Info
Combinatorics Study Group
Computer Vision