Title of article
An O(n3) time algorithm for recognizing threshold dimension 2 graphs
Author/Authors
Andrea Sterbini، نويسنده , , Thomas Raschle، نويسنده ,
Issue Information
دوهفته نامه با شماره پیاپی سال 1998
Pages
5
From page
255
To page
259
Keywords
Algorithms , Maximum cliques , Threshold dimension 2 graphs
Journal title
Information Processing Letters
Serial Year
1998
Journal title
Information Processing Letters
Record number
128947
Link To Document