Title of article
A linear time -approximation for the minimum strongly-connected spanning subgraph problem
Author/Authors
Liang Zhao، نويسنده , , Hiroshi Nagamochi، نويسنده , , Toshihide Ibaraki، نويسنده ,
Issue Information
دوهفته نامه با شماره پیاپی سال 2003
Pages
8
From page
63
To page
70
Keywords
approximation algorithms , Strongly connected subgraph , Cycle contraction
Journal title
Information Processing Letters
Serial Year
2003
Journal title
Information Processing Letters
Record number
129690
Link To Document