BIBLIO is the largest independent book marketplace in the world, with over 100 million books.

Skip to content

Dynamical Systems, Graphs, And Algorithms

Dynamical Systems, Graphs, And Algorithms

Dynamical Systems, Graphs, And Algorithms
Stock photo: cover may vary

Dynamical Systems, Graphs, And Algorithms Paperback - 2006

by George Osipenko

Add to wish list
  • New
New

Description

New/New. Brand New Original US Edition, Perfect Condition. Printed in English. Excellent Quality, Service and customer satisfaction guaranteed!
Ask the seller a question Add to wish list
A$78.51
A$21.59 Delivery to USA
Standard delivery: 7 to 14 days
More delivery options
Ships from Students Textbooks (India)

Details

  • Title Dynamical Systems, Graphs, And Algorithms
  • Author George Osipenko
  • Binding Paperback
  • Edition 1st
  • Condition New
  • Pages 288
  • Volumes 1
  • Language ENG
  • Publisher Springer, Berlin
  • Publication date 2006-11-06
  • Illustrated Yes
  • Features Illustrated, Index, Table of Contents
  • Bookseller's Inventory # BIBNNA-155195
  • ISBN 9783540355939 / 3540355936
  • Weight 0.96 lbs (0.44 kg)
  • Dimensions 9.28 x 6.28 x 0.46 in (23.57 x 15.95 x 1.17 cm)
  • Category Mathematics
  • Library of Congress Catalogue Number 2006930097
  • Dewey Decimal Code 515.39
  • Quantity available 1

About Students Textbooks India

Biblio member since 2009

Selling textbooks, International editions and reference books online from last 5 Years.

Terms of Sale:

30 day return guarantee, with full refund including shipping costs for up to 30 days after delivery if an item arrives misdescribed or damaged. Return address: Students_Textbooks 12 phankha road Jankpuri New Delhi 110036 India

Browse books from Students Textbooks

Reader reviews for Dynamical Systems, Graphs, And Algorithms

From the publisher

This book describes a family of algorithms for studying the global structure of systems. By a finite covering of the phase space we construct a directed graph with vertices corresponding to cells of the covering and edges corresponding to admissible transitions. The method is used, among other things, to locate the periodic orbits and the chain recurrent set, to construct the attractors and their basins, to estimate the entropy, and more.

tracking-