Search
 
Home| Join Our Mailing List| New Reviews| New Titles
Editor's Choice| Bestsellers| Textbooks| Book Series| Study Guides| E-Catalogues
  COMPUTER SCIENCE
  Artificial Intelligence
Database/ Information
Sciences

Decision Sciences
Digital Security
Fuzzy Logic
Machine Vision/ Pattern
Recognition

Neural Networks/ Networking
Parallel Processing/
Supercomputing

Software Engineering
Theoretical Computer Science
General
New Titles
May Bestsellers
Editor's Choice
Nobel Lectures
Textbooks
Recent Reviews
Book Series
Related Journals
  • International Journal of Semantic Computing (IJSC)
  • International Journal of Information Acquisition (IJIA)
  • Journal of Information & Knowledge Management (JIKM)
  • Computer Science Journals
  • New Mathematics and Natural Computation (NMNC)
  • Request for related catalogues
     
      PRODUCTS
      Journals
    eBooks
    Journals Archives
    eProceedings
     
      RESOURCES
      For Librarians
    For Authors
    For Booksellers
    For Translation Rights About Us
    Contact Us
    How to Order News
    Inspection Copy
     
    GRAPH ALGORITHMS AND APPLICATIONS 5

    by Giuseppe Liotta (University of Perugia, Italy) , Roberto Tamassia (Brown University, USA) , & Ioannis G Tollis ( & , )

    This book contains Volume 8 of the Journal of Graph Algorithms and Applications (JGAA). JGAA is a peer-reviewed scientific journal devoted to the publication of high-quality research papers on the analysis, design, implementation, and applications of graph algorithms. Areas of interest include computational biology, computational geometry, computer graphics, computer-aided design, computer and interconnection networks, constraint systems, databases, graph drawing, graph embedding and layout, knowledge representation, multimedia, software engineering, telecommunications networks, user interfaces and visualization, and VLSI circuit design.

    Graph Algorithms and Applications 5 presents contributions from prominent authors and includes selected papers from the Tenth International Symposium on Graph Drawing (GD 2002). All papers in the book have extensive diagrams and offer a unique treatment of graph algorithms focusing on the important applications.

     
    Contents:
    • Drawing Planar Graphs with Large Vertices and Thick Edges (G Barequet et al.)
    • Fast Approximation of Centrality (D Eppstein & J Wang)
    • Simple and Efficient Bilayer Cross Counting (W Barth et al.)
    • Algorithms for Single Link Failure Recovery and Related Problems (A M Bhosle & T F Gonzalez)
    • and other papers
     
    Readership: Researchers and practitioners in theoretical computer science, computer engineering, and combinatorics and graph theory.
     
     
    376pp    Pub. date: Jun 2006  
    ISBN:   978-981-256-845-8(pbk)
    981-256-845-X(pbk)
       US$94 / £55

     


     

    Imperial College Press  |  Global Publishing  |  Asia-Pacific Biotech News  |  Innovation Magazine
    Labcreations Co  |  Meeting Matters  |  National Academies Press

    Copyright © 2009 World Scientific Publishing Co. All rights reserved.
    Updated on 3 July 2009