This book constitutes the refereed proceedings of the 12th International Conference on Algorithms and Computation, ISAAC 2001, held in Christchurch, New Zealand in December 2001. The 62 revised full papers presented together with three invited papers were carefully reviewed and selected from a total of 124 submissions. The papers are organized in topical sections on combinatorial generation and optimization, parallel and distributed algorithms, graph drawing and algorithms, computational geometry, computational complexity and cryptology, automata and formal languages, computational biology and string matching, and algorithms and data structures.
A totally revised new edition of the bestselling guide to business school basics The bestselling book that invented the "MBA in a book" category, The Portable MBA Fifth Edition is a reliable and information-packed guide to the business school curriculum and experience. For years, professionals who need MBA-level information and insight-but don't need the hassle of business school-have turned to the Portable MBA series for the very best, most up-to-date coverage of the business basics. This new revised and expanded edition continues that long tradition with practical, real-world business insight from faculty members from the prestigious Darden School at the University of Virginia. With 50 percent new material, including new chapters on such topics as emerging economies, enterprise risk management, consumer behavior, managing teams, and up-to-date career advice, this is the best Portable MBA ever. Covers all the core topics you'd learn in business school, including finance, accounting, marketing, economics, ethics, operations management, management and leadership, and strategy. Every chapter is totally updated and seven new chapters have been added on vital business topics Includes case studies and interactive web-based examples Whether you own your own small business or work in a major corporate office, The Portable MBA gives you the comprehensive information and rich understanding of the business world that you need.
A graph is 1-planar if it can be embedded in the plane with at most one crossing per edge. A graph is outer-1-planar if it has an embedding in which every vertex is on the outer face and each edge has at most one crossing. We present a linear time algorithm to test whether a graph is outer-1-planar. The algorithm can be used to produce an outer-1-planar embedding in linear time if it exists.
Thank you for visiting our website. Would you like to provide feedback on how we could improve your experience?
This site does not use any third party cookies with one exception — it uses cookies from Google to deliver its services and to analyze traffic.Learn More.