Pages that link to "Item:Q5459150"
From MaRDI portal
The following pages link to Approximation Scheme for Lowest Outdegree Orientation and Graph Density Measures (Q5459150):
Displayed 10 items.
- Degree-constrained graph orientation: maximum satisfaction and minimum violation (Q260260) (← links)
- Approximation algorithms for the graph orientation minimizing the maximum weighted outdegree (Q543514) (← links)
- Improved induced matchings in sparse graphs (Q608287) (← links)
- Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree (Q716177) (← links)
- The complexity of the proper orientation number (Q2445254) (← links)
- \((k,p)\)-planarity: a relaxation of hybrid planarity (Q2664946) (← links)
- Single-pass streaming algorithms to partition graphs into few forests (Q2695324) (← links)
- A Constructive Arboricity Approximation Scheme (Q3297754) (← links)
- Improved Induced Matchings in Sparse Graphs (Q3656857) (← links)
- On the Locality of Nash-Williams Forest Decomposition and Star-Forest Decomposition (Q6098462) (← links)