MathSciNet Relay Station
MathSciNet bibliographic data
MR808004 05C38 (90B10)
Monien, B. How to find long paths efficiently. Analysis and design of algorithms for combinatorial problems (Udine, 1982), 239–254, North-Holland Math. Stud., 109, Ann. Discrete Math., 25, North-Holland, Amsterdam, 1985.
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