Constructing the highest subgraph for dense graphs is in NCAL

Authors: Andreev A.E.; Clementi A.E.F.; Rolim J.D.P.

Source: Theoretical Computer Science, Volume 166, Number 1, 20 October 1996 , pp. 12-12(1)

Publisher: Elsevier

Language: English

Document Type: Erratum

DOI: http://dx.doi.org/10.1016/0304-3975(96)80685-2

Publication date: 1996-10-20

• In this: publication
• By this: publisher
• In this Subject: Computer Science ,  Mathematics and Statistics
• By this author: Andreev A.E. ;  Clementi A.E.F. ;  Rolim J.D.P.

Website © Publishing Technology. Article copyright remains with the publisher, society or author(s) as specified within the article.

• Terms and conditions
• Privacy policy
• Information for advertisers