Sciweavers

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

5

EJC
2010

favoriteEmaildiscussreport

93views Information Technology» more EJC 2010»

A note on antisymmetric flows in graphs

13 years 4 months ago

A note on antisymmetric flows in graphs

Download kam.mff.cuni.cz

We prove that any orientation of a graph without bridges and directed 2-edge-cuts admits a Z3 2

Zdenek Dvorak, Tomás Kaiser, Daniel Kr&aacu

Real-time Traffic

3-antisymmetric Flow | EJC 2007 | EJC 2010 |

claim paper

Related Content

» Complexity of the Exact Domatic Number Problem and of the Exact Conveyor Flow Shop Problem

» Truthful Unsplittable Flow for Large Capacity Networks

» Inapproximability of edgedisjoint paths and low congestion routing on undirected graphs

Post Info
More Details (n/a)

Added	10 Dec 2010
Updated	10 Dec 2010
Type	Journal
Year	2010
Where	EJC
Authors	Zdenek Dvorak, Tomás Kaiser, Daniel Král', Jean-Sébastien Sereni

Comments (0)