Engineering edge orientation algorithms

DOI10.4230/LIPICS.ESA.2024.97MaRDI QIDQ7253167zbMATH OpenFDO

Authors Henrik Reinstädtler, Christian Schulz, Bora Uçar

Publication date 26 May 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.ESA.2024.97

zbMATH Keywords

graph algorithmsedge orientationpseudoarboricity

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• scientific article; zbMATH DE number 1670532 (Why is no real title available?)
• A network flow solution to some nonlinear 0-1 programming problems, with applications to graph theory
• A new approach to the maximum-flow problem
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
• An Algebraic Sparsified Nested Dissection Algorithm Using Low-Rank Approximations
• Approximation Scheme for Lowest Outdegree Orientation and Graph Density Measures
• Benchmarking optimization software with performance profiles.
• Computing the block triangular form of a sparse matrix
• Design, implementation, and analysis of maximum transversal algorithms
• Fast Algorithms for Pseudoarboricity
• GRAPH ORIENTATION ALGORITHMS TO MINIMIZE THE MAXIMUM OUTDEGREE
• Introduction to algorithms.
• Minimizing maximum indegree
• Network Flow and Testing Graph Connectivity
• The Union of Matroids and the Rigidity of Frameworks
• The University of Florida sparse matrix collection

This page was built for publication: Engineering edge orientation algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7253167)