Minimizing maximum indegree
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 3896697
- scientific article; zbMATH DE number 3958222
- scientific article; zbMATH DE number 2221947
- Minimization via duality
- Minimizing the expected minimum
- OPTIMAL HYPER-MINIMIZATION
- Decreasing the maximum degree of a graph
- Minimax theorems
- Degrees bounding minimal degrees
Cites work
Cited in
(20)- Degree-constrained graph orientation: maximum satisfaction and minimum violation
- Strongly Connected Orientation with Minimum Lexicographic Order of Indegrees
- Approximation algorithms for the graph orientation minimizing the maximum weighted outdegree
- Graph orientation with edge modifications
- Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree
- Degree-constrained orientation of maximum satisfaction: graph classes and parameterized complexity
- Shortest longest-path graph orientations
- Graph orientation to maximize the minimum weighted outdegree
- Gap-Planar Graphs
- Minimum entropy orientations
- Edges and switches, tunnels and bridges
- Graph balancing: a special case of scheduling unrelated parallel machines
- Gap-planar graphs
- Graph orientation with splits
- Egalitarian graph orientations
- The edge-orientation problem and some of its variants on weighted graphs
- scientific article; zbMATH DE number 880643 (Why is no real title available?)
- Density decompositions of networks
- GRAPH ORIENTATION ALGORITHMS TO MINIMIZE THE MAXIMUM OUTDEGREE
- The complexity of the proper orientation number
This page was built for publication: Minimizing maximum indegree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1887077)