Graphcut textures: image and video synthesis using graph cuts
ACM SIGGRAPH 2003 Papers
Deadline Analysis of Interrupt-Driven Software
IEEE Transactions on Software Engineering
Morphological Image Compositing
IEEE Transactions on Pattern Analysis and Machine Intelligence
High Resolution Animated Scenes from Stills
IEEE Transactions on Visualization and Computer Graphics
Part III: dynamic texture synthesis
ACM SIGGRAPH 2007 courses
Improvement of handoff in wireless networks using mobility prediction and multicasting techniques
EHAC'05 Proceedings of the 4th WSEAS International Conference on Electronics, Hardware, Wireless and Optical Communications
Channel assignment and access protocols for spectrum-agile networks with single-transceiver radios
NETWORKING'11 Proceedings of the 10th international IFIP TC 6 conference on Networking - Volume Part II
Fast and simple approximation of the diameter and radius of a graph
WEA'06 Proceedings of the 5th international conference on Experimental Algorithms
Optimization of parallel FDTD computations based on structural redeployment of macro data flow nodes
PPAM'05 Proceedings of the 6th international conference on Parallel Processing and Applied Mathematics
A quadratic algorithm for testing of omega-codes
ACIIDS'12 Proceedings of the 4th Asian conference on Intelligent Information and Database Systems - Volume Part I
Optimal algorithms for the batch scheduling problem in OBS networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
A cyberphysical synthesis approach for error recovery in digital microfluidic biochips
DATE '12 Proceedings of the Conference on Design, Automation and Test in Europe
Hi-index | 0.00 |
Once again, Robert Sedgewick provides a current and comprehensive introduction to important algorithms. The focus this time is on graph algorithms, which are increasingly critical for a wide range of applications, such as network connectivity, circuit design, scheduling, transaction processing, and resource allocation. In this book, Sedgewick offers the same successful blend of theory and practice with concise implementations that can be tested on real applications, which has made his work popular with programmers for many years. Algorithms in C, Third Edition, Part 5: Graph Algorithms is the second book in Sedgewick's thoroughly revised and rewritten series. The first book, Parts 1-4, addresses fundamental algorithms, data structures, sorting, and searching. A forthcoming third book will focus on strings, geometry, and a range of advanced algorithms. Each book's expanded coverage features new algorithms and implementations, enhanced descriptions and diagrams, and a wealth of new exercises for polishing skills. A focus on abstract data types makes the programs more broadly useful and relevant for the modern object-oriented programming environment.Coverage includes: A complete overview of graph properties and types Diagraphs and DAGs Minimum spanning trees Shortest paths Network flows Diagrams, sample C code, and detailed algorithm descriptions The Web site for this book (http://www.cs.princeton.edu/~rs/) provides additional source code for programmers along with numerous support materials for educators.A landmark revision, Algorithms in C, Third Edition, Part 5 provides a complete tool set for programmers to implement, debug, and use graph algorithms across a wide range of computer applications.