10_split_Introduction to Algorithms 2nd Edition

10_split_Introduction to Algorithms 2nd Edition - 735 28.3...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
Contents ix 25 All-Pairs Shortest Paths 620 25.1 Shortest paths and matrix multiplication 622 25.2 The Floyd-Warshall algorithm 629 25.3 Johnson’s algorithm for sparse graphs 636 26 Maximum Flow 643 26.1 Flow networks 644 26.2 The Ford-Fulkerson method 651 26.3 Maximum bipartite matching 664 ± 26.4 Push-relabel algorithms 669 ± 26.5 The relabel-to-front algorithm 681 VII Selected Topics Introduction 701 27 Sorting Networks 704 27.1 Comparison networks 704 27.2 The zero-one principle 709 27.3 A bitonic sorting network 712 27.4 A merging network 716 27.5 A sorting network 719 28 Matrix Operations 725 28.1 Properties of matrices 725 28.2 Strassen’s algorithm for matrix multiplication
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: 735 28.3 Solving systems of linear equations 742 28.4 Inverting matrices 755 28.5 Symmetric positive-denite matrices and least-squares approximation 760 29 Linear Programming 770 29.1 Standard and slack forms 777 29.2 Formulating problems as linear programs 785 29.3 The simplex algorithm 790 29.4 Duality 804 29.5 The initial basic feasible solution 811 30 Polynomials and the FFT 822 30.1 Representation of polynomials 824 30.2 The DFT and FFT 830 30.3 Efcient FFT implementations 839...
View Full Document

Ask a homework question - tutors are online