The.Algorithm.Design.Manual.Springer-Verlag.1998
The.Algorithm.Design.Manual.Springer-Verlag.1998 The.Algorithm.Design.Manual.Springer-Verlag.1998
Index P phylogenic tree , piano mover's problem Picasso, P. , pieces of a graph pilots pink panther pivoting rules , pixel geometry , pLab planar drawings , planar drawings - related problems planar graph , planar graph - clique planar graph - coloring planar graph - instances planar graph - isomorphism Planarity Detection and Embedding planarity testing - related problems planar separators planar subdivisions planar sweep algorithms plumbing point-spread function point distributions pointer manipulation point in polygon point location , point location - related problems , , , point robots points point set clusters Poisson distribution Polka polygonal data structure Polygon Partitioning polygon partitioning - related problems file:///E|/BOOK/BOOK6/INDEX_P.HTM (3 of 5) [19/1/2003 1:33:02]
Index P polygons polygon triangulation polyhedral simplification polyline graph drawings polynomial-time approximation scheme polynomial-time problems polynomial evaluation polynomial multiplication poor thin people popular keys porting code POSIT positions position tree potential function power diagrams power set powers of graphs Prüfer codes , precedence-constrainted scheduling precedence constraints , precision preemptive scheduling prefix - string preflow-push methods preprocessing - graph algorithms presortedness measures Pretty Good Privacy previous subset PRF price-per-pound Prim's algorithm , primality testing , prime number prime number theorem principle of optimality file:///E|/BOOK/BOOK6/INDEX_P.HTM (4 of 5) [19/1/2003 1:33:02]
- Page 679 and 680: Professional Consulting Services Ne
- Page 681 and 682: Index A Up: Index - All Index: A ab
- Page 683 and 684: Index A artists steal ASA ASCII asp
- Page 685 and 686: Index B binary representation - sub
- Page 687 and 688: Index C Up: Index - All Index: C C+
- Page 689 and 690: Index C clustering , , co-NP coding
- Page 691 and 692: Index C consulting services , conta
- Page 693 and 694: Index D Up: Index - All Index: D DA
- Page 695 and 696: Index D Dictionaries dictionaries -
- Page 697 and 698: Index D dynamic programming - appli
- Page 699 and 700: Index E empirical results - heurist
- Page 701 and 702: Index F Up: Index - All Index: F fa
- Page 703 and 704: Index F frequency domain friend-or-
- Page 705 and 706: Index G geometric shortest path , g
- Page 707 and 708: Index H Up: Index - All Index: H ha
- Page 709 and 710: Index H Algorithms Tue Jun 3 11:59:
- Page 711 and 712: Index I independent set - alternate
- Page 713 and 714: Index J Up: Index - All Index: J ji
- Page 715 and 716: Index K Algorithms Tue Jun 3 11:59:
- Page 717 and 718: Index L linear congruential generat
- Page 719 and 720: Index M Up: Index - All Index: M ma
- Page 721 and 722: Index M mindset minima minimax sear
- Page 723 and 724: Index N Up: Index - All Index: N na
- Page 725 and 726: Index N numerical analysis numerica
- Page 727 and 728: Index O overlap graph overpasses -
- Page 729: Index P , , , , , , , , , , passwor
- Page 733 and 734: Index Q Up: Index - All Index: Q Qh
- Page 735 and 736: Index R ranking combinatorial objec
- Page 737 and 738: Index S Up: Index - All Index: S s-
- Page 739 and 740: Index S Shape Similarity shape simp
- Page 741 and 742: Index S solar year Solving Linear E
- Page 743 and 744: Index S straight-line graph drawing
- Page 745 and 746: Index T Up: Index - All Index: T ta
- Page 747 and 748: Index T trees - matching trees - pa
- Page 749 and 750: Index V Up: Index - All Index: V va
- Page 751 and 752: Index W Up: Index - All Index: W wa
- Page 753 and 754: Index Y Up: Index - All Index: Y Yo
- Page 755 and 756: Index (complete) Up: Index - All In
- Page 757 and 758: Index (complete) arm, robot around
- Page 759 and 760: Index (complete) binary search tree
- Page 761 and 762: Index (complete) center vertex, , C
- Page 763 and 764: Index (complete) compaction compari
- Page 765 and 766: Index (complete) counting paths, co
- Page 767 and 768: Index (complete) deletion from bina
- Page 769 and 770: Index (complete) dominance ordering
- Page 771 and 772: Index (complete) English to French
- Page 773 and 774: Index (complete) file directory tre
- Page 775 and 776: Index (complete) geom.bib, geometri
- Page 777 and 778: Index (complete) Hamiltonian Cycle
- Page 779 and 780: Index (complete) implementation cha
Index P<br />
polygons<br />
polygon triangulation<br />
polyhedral simplification<br />
polyline graph drawings<br />
polynomial-time approximation scheme<br />
polynomial-time problems<br />
polynomial evaluation<br />
polynomial multiplication<br />
poor thin people<br />
popular keys<br />
porting code<br />
POSIT<br />
positions<br />
position tree<br />
potential function<br />
power diagrams<br />
power set<br />
powers of graphs<br />
Prüfer codes ,<br />
precedence-constrainted scheduling<br />
precedence constraints ,<br />
precision<br />
preemptive scheduling<br />
prefix - string<br />
preflow-push methods<br />
preprocessing - graph algorithms<br />
presortedness measures<br />
Pretty Good Privacy<br />
previous subset<br />
PRF<br />
price-per-pound<br />
Prim's algorithm ,<br />
primality testing ,<br />
prime number<br />
prime number theorem<br />
principle of optimality<br />
file:///E|/BOOK/BOOK6/INDEX_P.HTM (4 of 5) [19/1/2003 1:33:02]
Change language