MathSciNet Relay Station
MathSciNet bibliographic data
MR2263489 68Q25 (05C85)
Tomita, Etsuji; Tanaka, Akira; Takahashi, Haruhisa The worst-case time complexity for generating all maximal cliques and computational experiments. Theoret. Comput. Sci. 363 (2006), no. 1, 28–42.
Article
 
For users without a MathSciNet license , Relay Station allows linking from MR numbers in online mathematical literature directly to electronic journals and original articles. Subscribers receive the added value of full MathSciNet reviews.

Username/Password Subscribers access MathSciNet here

AMS Home Page

American Mathematical Society American Mathematical Society
201 Charles Street
Providence, RI 02904-6248 USA
© Copyright 2017, American Mathematical Society
Privacy Statement