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
7
click to vote
DAM
1999
favorite
Email
discuss
report
75
views
more
DAM 1999
»
On k-partitioning of Hamming Graphs
13 years 4 months ago
Download
mcs.uwsuper.edu
Sergei L. Bezrukov, Robert Elsässer, Ulf-Pete
Real-time Traffic
DAM 1999
|
claim paper
Related Content
»
On Bounds for the kPartitioning of Graphs
»
On the Inapproximability of Vertex Cover on kPartite kUniform Hypergraphs
»
The second largest component in the supercritical 2D Hamming graph
»
Estimating Bounds for Quadratic Assignment Problems Associated with Hamming and Manhattan ...
»
Distance Labelling Problems for Hypercubes and Hamming Graphs A Survey
»
On the Acyclic Chromatic Number of Hamming Graphs
»
Binary codes from the line graph of the ncube
»
A short proof of a theorem of Bang and Koolen
»
On the canonical metric representation average distance and partial Hamming graphs
more »
Post Info
More Details (n/a)
Added
22 Dec 2010
Updated
22 Dec 2010
Type
Journal
Year
1999
Where
DAM
Authors
Sergei L. Bezrukov, Robert Elsässer, Ulf-Peter Schroeder
Comments
(0)
Researcher Info
DAM 2010 Study Group
Computer Vision