Recommendations
- Approximation Algorithms for the Graph Orientation Minimizing the Maximum Weighted Outdegree
- Approximation algorithms for the graph orientation minimizing the maximum weighted outdegree
- GRAPH ORIENTATION ALGORITHMS TO MINIMIZE THE MAXIMUM OUTDEGREE
- Graph orientation to maximize the minimum weighted outdegree
- Upper and lower degree-constrained graph orientation with minimum penalty
Cites work
- Approximation algorithms for the graph orientation minimizing the maximum weighted outdegree
- Correlation clustering
- Egalitarian graph orientations
- General factors of graphs
- Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree
- Graph orientation to maximize the minimum weighted outdegree
- Graph orientation with splits
- Graph orientations optimizing the number of light or heavy vertices
- scientific article; zbMATH DE number 2185626 (Why is no real title available?)
- Introduction to algorithms.
- Max flows in O(nm) time, or better
- Minimizing maximum indegree
- Planar orientations with low out-degree and compaction of adjacency matrices
- The factorization of graphs. II
Cited in
(3)
This page was built for publication: Graph orientation with edge modifications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5859684)
