The.Algorithm.Design.Manual.Springer-Verlag.1998
The.Algorithm.Design.Manual.Springer-Verlag.1998 The.Algorithm.Design.Manual.Springer-Verlag.1998
1.5 Graph Problems -- hard problems 1.5 Graph Problems -- hard problems Specific Algorithms ● 1.5.1 Clique ● 1.5.2 Independent Set ● 1.5.3 Vertex Cover ● 1.5.4 Traveling Salesman Problem ● 1.5.5 Hamiltonian Cycle ● 1.5.6 Graph Partition ● 1.5.7 Vertex Coloring ● 1.5.8 Edge Coloring ● 1.5.9 Graph Isomorphism ● 1.5.10 Steiner Tree ● 1.5.11 Feedback Edge/Vertex Set About the Book Send us Mail Go to Main Page This page last modified on Tue Jun 03, 1997 . file:///E|/WEBSITE/MAJOR_SE/1_5.HTM [19/1/2003 1:36:32]
1.6 Computational Geometry 1.6 Computational Geometry Specific Algorithms ● 1.6.1 Robust Geometric Primitives ● 1.6.2 Convex Hull ● 1.6.3 Triangulation ● 1.6.4 Voronoi Diagrams ● 1.6.5 Nearest Neighbor Search ● 1.6.6 Range Search ● 1.6.7 Point Location ● 1.6.8 Intersection Detection ● 1.6.9 Bin Packing ● 1.6.10 Medial-Axis Transformation ● 1.6.11 Polygon Partitioning ● 1.6.12 Simplifying Polygons ● 1.6.13 Shape Similarity ● 1.6.14 Motion Planning ● 1.6.15 Maintaining Line Arrangements ● 1.6.16 Minkowski Sum About the Book Send us Mail Go to Main Page This page last modified on Tue Jun 03, 1997 . file:///E|/WEBSITE/MAJOR_SE/1_6.HTM [19/1/2003 1:36:32]
- Page 1037 and 1038: Lecture 23 - approximation algorith
- Page 1039 and 1040: Lecture 23 - approximation algorith
- Page 1041 and 1042: Lecture 23 - approximation algorith
- Page 1043 and 1044: Lecture 23 - approximation algorith
- Page 1045 and 1046: About this document ... Up: No Titl
- Page 1047 and 1048: 1.1.6 Kd-Trees ● Point Location
- Page 1049 and 1050: 1.1.3 Suffix Trees and Arrays Send
- Page 1051 and 1052: 1.5.1 Clique ● Vertex Cover Go to
- Page 1053 and 1054: 1.6.2 Convex Hull Related Problems
- Page 1055 and 1056: Visual Links Index file:///E|/WEBSI
- Page 1057 and 1058: Visual Links Index file:///E|/WEBSI
- Page 1059 and 1060: Visual Links Index file:///E|/WEBSI
- Page 1061 and 1062: Visual Links Index file:///E|/WEBSI
- Page 1063 and 1064: Visual Links Index file:///E|/WEBSI
- Page 1065 and 1066: Visual Links Index file:///E|/WEBSI
- Page 1067 and 1068: Visual Links Index file:///E|/WEBSI
- Page 1069 and 1070: Visual Links Index file:///E|/WEBSI
- Page 1071 and 1072: Visual Links Index file:///E|/WEBSI
- Page 1073 and 1074: Visual Links Index file:///E|/WEBSI
- Page 1075 and 1076: Visual Links Index file:///E|/WEBSI
- Page 1077 and 1078: Visual Links Index file:///E|/WEBSI
- Page 1079 and 1080: Visual Links Index file:///E|/WEBSI
- Page 1081 and 1082: Visual Links Index file:///E|/WEBSI
- Page 1083 and 1084: About the Ratings About the Ratings
- Page 1085 and 1086: 1.2 Numerical Problems 1.2 Numerica
- Page 1087: 1.4 Graph Problems -- polynomial-ti
- Page 1091 and 1092: C++ Language Implementations Algori
- Page 1093 and 1094: C Language Implementations ● POSI
- Page 1095 and 1096: FORTRAN Language Implementations Al
- Page 1097 and 1098: Lisp Language Implementations Algor
- Page 1099 and 1100: Algorithm Repository -- Citations C
- Page 1101 and 1102: Practical Algorithm Design -- User
- Page 1103 and 1104: LEDA - A Library of Efficient Data
- Page 1105 and 1106: Discrete Optimization Methods Discr
- Page 1107 and 1108: Netlib / TOMS -- Collected Algorith
- Page 1109 and 1110: Netlib / TOMS -- Collected Algorith
- Page 1111 and 1112: Xtango and Polka Algorithm Animatio
- Page 1113 and 1114: Combinatorica Combinatorica Combina
- Page 1115 and 1116: file:///E|/WEBSITE/IMPLEMEN/GRAPHBA
- Page 1117 and 1118: 1.4.1 Connected Components 1.4.1 Co
- Page 1119 and 1120: 1.5.9 Graph Isomorphism 1.5.9 Graph
- Page 1121 and 1122: 1.2.3 Matrix Multiplication 1.2.3 M
- Page 1123 and 1124: 1.6.14 Motion Planning 1.6.14 Motio
- Page 1125 and 1126: 1.4.9 Network Flow 1.4.9 Network Fl
- Page 1127 and 1128: 1.1.2 Priority Queues 1.1.2 Priorit
- Page 1129 and 1130: 1.5.10 Steiner Tree 1.5.10 Steiner
- Page 1131 and 1132: 1.4.5 Transitive Closure and Reduct
- Page 1133 and 1134: About the Book -- The Algorithm Des
- Page 1135 and 1136: About the Book -- The Algorithm Des
- Page 1137 and 1138: Genocop -- Optimization via Genetic
1.5 Graph Problems -- hard problems<br />
1.5 Graph Problems -- hard problems<br />
Specific <strong>Algorithm</strong>s<br />
● 1.5.1 Clique<br />
● 1.5.2 Independent Set<br />
● 1.5.3 Vertex Cover<br />
● 1.5.4 Traveling Salesman Problem<br />
● 1.5.5 Hamiltonian Cycle<br />
● 1.5.6 Graph Partition<br />
● 1.5.7 Vertex Coloring<br />
● 1.5.8 Edge Coloring<br />
● 1.5.9 Graph Isomorphism<br />
● 1.5.10 Steiner Tree<br />
● 1.5.11 Feedback Edge/Vertex Set<br />
About the Book<br />
Send us Mail<br />
Go to Main Page<br />
This page last modified on Tue Jun 03, 1997 .<br />
file:///E|/WEBSITE/MAJOR_SE/1_5.HTM [19/1/2003 1:36:32]
Change language