GRAPH ORIENTATION ALGORITHMS TO MINIMIZE THE MAXIMUM OUTDEGREE
From MaRDI portal
Publication:3434271
DOI10.1142/S0129054107004644zbMATH Open1119.68223OpenAlexW2033433572MaRDI QIDQ3434271FDOQ3434271
Authors: Yuichi Asahiro, Hirotaka Ono, Kouhei Zenmyo, Eiji Miyano 
Publication date: 25 April 2007
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054107004644
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 to maximize the minimum weighted outdegree
- Graph orientations optimizing the number of light or heavy vertices
- Graph orientations optimizing the number of light or heavy vertices
Cites Work
- Planar orientations with low out-degree and compaction of adjacency matrices
- Minimizing maximum indegree
- On Orientations, Connectivity and Odd-Vertex-Pairings in Finite Graphs
- Strongly connected orientations of mixed multigraphs
- Exact and Approximate Algorithms for Scheduling Nonidentical Processors
- A Fast Parametric Maximum Flow Algorithm and Applications
- Approximation algorithms for scheduling unrelated parallel machines
- Title not available (Why is that?)
- Network Flow and Testing Graph Connectivity
- A Theorem on Graphs, with an Application to a Problem of Traffic Control
- Distances in orientations of graphs
- A combinatorial theorem in plane geometry
- Complexity of approximating the oriented diameter of chordal graphs
- Polynomial time approximation algorithms for machine scheduling: Ten open problems
- Diameter-preserving orientations of the torus
Cited In (25)
- Strongly Connected Orientation with Minimum Lexicographic Order of Indegrees
- Degree-constrained graph orientation: maximum satisfaction and minimum violation
- A fully asynchronous and fault tolerant distributed algorithm to compute a minimum graph orientation
- On the complexity of finding well-balanced orientations with upper bounds on the out-degrees
- Approximation Scheme for Lowest Outdegree Orientation and Graph Density Measures
- Graph orientation with edge modifications
- Approximation algorithms for the graph orientation minimizing the maximum weighted outdegree
- Edge partitions of optimal 2-plane and 3-plane graphs
- Graph orientation with splits
- A constructive arboricity approximation scheme
- 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
- Graph orientation to maximize the minimum weighted outdegree
- Parameterized orientable deletion
- Parameterized orientable deletion
- Literal Selection in Switching Lattice Design
- Graph balancing: a special case of scheduling unrelated parallel machines
- Laplacian energy of digraphs and a minimum Laplacian energy algorithm
- Graph orientation with splits
- Density decompositions of networks
- Approximation Algorithms for the Graph Orientation Minimizing the Maximum Weighted Outdegree
- On finding orientations with the fewest number of vertices with small out-degree
- A note on graph balancing problems with restrictions
- The complexity of the proper orientation number
- Upper and lower degree-constrained graph orientation with minimum penalty
This page was built for publication: GRAPH ORIENTATION ALGORITHMS TO MINIMIZE THE MAXIMUM OUTDEGREE
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3434271)
