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
60
click to vote
DMTCS
2011
favorite
Email
discuss
report
261
views
Mathematics
»
more
DMTCS 2011
»
An expected polynomial time algorithm for coloring 2-colorable 3-graphs
12 years 8 months ago
Download
www.math.uni-hamburg.de
Abstract. We present an algorithm that for 2-colorable 3-uniform hypergraphs, finds a 2-coloring in average running time O(n5 log2 n).
Yury Person, Mathias Schacht
Real-time Traffic
DMTCS 2011
|
Log2
|
Mathematics
|
N5
|
Running Time
|
claim paper
Related Content
»
Low Memory Distributed Protocols for 2Coloring
»
Coloring Sparse Random kColorable Graphs in Polynomial Expected Time
»
Algorithmic Aspects of Acyclic Edge Colorings
»
Computing hereditary convex structures
»
A new characterization of P6free graphs
»
Sampling Unlabeled Biconnected Planar Graphs
»
Improved Inapproximability Results for Maximum kColorable Subgraph
»
Generating unlabeled connected cubic planar graphs uniformly at random
»
Counting Subgraphs via Homomorphisms
more »
Post Info
More Details (n/a)
Added
18 Dec 2011
Updated
18 Dec 2011
Type
Journal
Year
2011
Where
DMTCS
Authors
Yury Person, Mathias Schacht
Comments
(0)
Researcher Info
Mathematics Study Group
Computer Vision