Pages that link to "Item:Q2819493"
From MaRDI portal
The following pages link to Directing Road Networks by Listing Strong Orientations (Q2819493):
Displaying 8 items.
- Efficient enumeration of graph orientations with sources (Q1647832) (← links)
- Comparing directed and weighted road maps (Q1713427) (← links)
- Maximal strongly connected cliques in directed graphs: algorithms and bounds (Q1983136) (← links)
- FPT algorithms to enumerate and count acyclic and totally cyclic orientations (Q2132402) (← links)
- Enumerating \(k\)-arc-connected orientations (Q2211357) (← links)
- (Q5136240) (← links)
- Model and methods to address urban road network problems with disruptions (Q6069920) (← links)
- The strong network orientation problem (Q6082268) (← links)
