Minimizing maximum indegree

DOI10.1016/j.dam.2003.07.007zbMath1053.05068OpenAlexW1973020798WikidataQ57259031 ScholiaQ57259031MaRDI QIDQ1887077

Yanyan Li

Publication date: 23 November 2004

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2003.07.007

zbMATH Keywords

Extremal orientation

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items

Strongly Connected Orientation with Minimum Lexicographic Order of Indegrees, Graph balancing: a special case of scheduling unrelated parallel machines, The complexity of the proper orientation number, Gap-Planar Graphs, GRAPH ORIENTATION TO MAXIMIZE THE MINIMUM WEIGHTED OUTDEGREE, Approximation algorithms for the graph orientation minimizing the maximum weighted outdegree, Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree, Gap-planar graphs, Degree-constrained orientation of maximum satisfaction: graph classes and parameterized complexity, Graph orientation with splits, The edge-orientation problem and some of its variants on weighted graphs, Edges and switches, tunnels and bridges, Density decompositions of networks, Graph Orientation with Edge Modifications, GRAPH ORIENTATION ALGORITHMS TO MINIMIZE THE MAXIMUM OUTDEGREE, Degree-constrained graph orientation: maximum satisfaction and minimum violation

Cites Work

• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item