Old Web
English
Sign In
Acemap
>
Paper
>
An algorithm for finding a minimum-cost strongly connected re-orientation of a directed graph
An algorithm for finding a minimum-cost strongly connected re-orientation of a directed graph
1982
Satoru Fujishige
Nobuyuki Tomizawa
Keywords:
Combinatorics
Mathematical optimization
Directed graph
Moral graph
Loop (graph theory)
Transpose graph
Biconnected graph
Strongly connected component
Voltage graph
Distance-hereditary graph
Mathematics
Correction
Cite
Save
Machine Reading By IdeaReader
0
References
0
Citations
NaN
KQI
[]