Strongly Connected Orientation with Minimum Lexicographic Order of Indegrees (Q6114862): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: GRAPH ORIENTATION ALGORITHMS TO MINIMIZE THE MAXIMUM OUTDEGREE / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Egalitarian Graph Orientations / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Decreasing minimization on M-convex sets: background and structures / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Decreasing minimization on M-convex sets: algorithms and applications / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Minimizing maximum indegree / rank | |||
Normal rank | |||
Latest revision as of 15:22, 2 August 2024
scientific article; zbMATH DE number 7726978
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Strongly Connected Orientation with Minimum Lexicographic Order of Indegrees |
scientific article; zbMATH DE number 7726978 |
Statements
Strongly Connected Orientation with Minimum Lexicographic Order of Indegrees (English)
0 references
15 August 2023
0 references
orientation
0 references
strongly connected digraph
0 references
indegree
0 references
