Changes between Initial Version and Version 1 of Ticket #7528
 Timestamp:
 12/05/09 14:16:03 (11 years ago)
Legend:
 Unmodified
 Added
 Removed
 Modified

Ticket #7528

Property
Status
changed from
new
toneeds_review

Property
Status
changed from

Ticket #7528 – Description
initial v1 1 Given an undirected graph and an integer k, it is possible to find through the flow algorithm an orientation of it such that any vertex has an outdegree of at most k ( or say that this is impossible ) 1 The function minimum_outdegree_orientation() returns a DiGraph which is an orientation of the current graph, such that the maximum outdegree is minimized. 2 3 Uses LP ! 4 5 Nathann