Title of article :
Linear time algorithms for graph search and connectivity determination on complement graphs
Author/Authors :
Hiro Ito، نويسنده , , Mitsuo Yokoyama، نويسنده ,
Issue Information :
دوهفته نامه با شماره پیاپی سال 1998
Pages :
5
From page :
209
To page :
213
Keywords :
algorithm , computational complexity , Complement graph: Grdph search: Graph representation , connectivity
Journal title :
Information Processing Letters
Serial Year :
1998
Journal title :
Information Processing Letters
Record number :
128892
Link To Document :
بازگشت