4 search results - page 1 / 1 » A note on antisymmetric flows in graphs |
EJC
2010
13 years 5 months ago
2010
We prove that any orientation of a graph without bridges and directed 2-edge-cuts admits a Z3 2
MST
2006
13 years 4 months ago
2006
We prove that the exact versions of the domatic number problem are complete for the levels of the boolean hierarchy over NP. The domatic number problem, which arises in the area of...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
The unsplittable flow problem is one of the most extensively studied optimization problems in the field of networking. An instance of it consists of an edge capacitated graph and ...
ECCC
2007
13 years 4 months ago
2007
In the undirected Edge-Disjoint Paths problem with Congestion (EDPwC), we are given an undirected graph with V nodes, a set of terminal pairs and an integer c. The objective is to...