Planet
navi homePPSaboutscreenshotsdownloaddevelopmentforum

source: downloads/boost_1_33_1/libs/graph/doc/bibliography.html @ 12

Last change on this file since 12 was 12, checked in by landauf, 18 years ago

added boost
File size: 13.6 KB
Line 
1<HTML>
2<!--
3  -- Copyright (c) Jeremy Siek 2000
4  --
5  -- Permission to use, copy, modify, distribute and sell this software
6  -- and its documentation for any purpose is hereby granted without fee,
7  -- provided that the above copyright notice appears in all copies and
8  -- that both that copyright notice and this permission notice appear
9  -- in supporting documentation.  Silicon Graphics makes no
10  -- representations about the suitability of this software for any
11  -- purpose.  It is provided "as is" without express or implied warranty.
12  -->
13<Head>
14<Title>Boost Graph Library: Bibliography</Title>
15<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b" 
16        ALINK="#ff0000"> 
17<IMG SRC="../../../boost.png" 
18     ALT="C++ Boost" width="277" height="86"> 
19
20<BR Clear>
21
22
23<H2>Bibliography</H2>
24
25<DL COMMapCT><DD><P></P><DT><A NAME="aho83:_data_struct_algo">1</A>
26<DD>
27A.&nbsp;V. Aho, J.&nbsp;E. Hopcroft, and J.&nbsp;D. Ullman.
28<BR><EM>Data Structures and Algorithms</EM>.
29<BR>Addison-Wesley, 1983.
30
31<P></P><DT><A NAME="austern99:_gener_progr_stl">2</A>
32<DD>
33M.&nbsp;H. Austern.
34<BR><EM>Generic Programming and the STL</EM>.
35<BR>Professional computing series. Addison-Wesley, 1999.
36
37<P></P><DT><A NAME="baumgartner95:_signatures">3</A>
38<DD>
39G.&nbsp;Baumgartner and V.&nbsp;F. Russo.
40<BR>Signatures: A language extension for improving type abstraction and
41  subtype polymorphism in C++.
42<BR><EM>Software-Practice and Experience</EM>, 25(8):863-889, August 1995.
43
44<P></P><DT><A NAME="bellman58">4</A>
45<DD>
46R.&nbsp;Bellman.
47<BR>On a routing problem.
48<BR><EM>Quarterly of Applied Mathematics</EM>, 16(1):87-90, 1958.
49
50<P></P><DT><A NAME="bruce95">5</A>
51<DD>
52K.&nbsp;B. Bruce, L.&nbsp;Cardelli, G.&nbsp;Castagna, the Hopkins Objects&nbsp;Group, G.&nbsp;T.
53  Leavens, and B.&nbsp;Pierce.
54<BR>On binary methods.
55<BR><EM>Theory and Practice of Object Systems</EM>, 1:221-242, 1995.
56
57<P></P><DT><A NAME="coleman85:_algor">6</A>
58<DD>
59T.&nbsp;F. Coleman, B.&nbsp;S. Garbow, and J.&nbsp;J. Mor'e.
60<BR>Algorithm 649: Fortran subroutines for estimating sparse hessian
61  matrices.
62<BR><EM>ACM Transactions on Mathematical Software</EM>, 11(4):378, December
63  1985.
64
65<P></P><DT><A NAME="coleman84:_estim_jacob">7</A>
66<DD>
67T.&nbsp;F. Coleman and J.&nbsp;J. Mor'e.
68<BR>Estimation of sparse jacobian matrices and graph coloring problems.
69<BR><EM>SIAM Journal on Numerical Analysis</EM>, 20:187-209,, 1984.
70
71<P></P><DT><A NAME="clr90">8</A>
72<DD>
73T.&nbsp;Cormen, C.&nbsp;Leiserson, and R.&nbsp;Rivest.
74<BR><EM>Introduction to Algorithms</EM>.
75<BR>McGraw-Hill, 1990.
76
77<P></P><DT><A NAME="curtis74:_jacob">9</A>
78<DD>
79A.&nbsp;Curtis, M.&nbsp;Powell, and J.&nbsp;Reid.
80<BR>On the estimation of sparse jacobian matrices.
81<BR><EM>Journal of the Institute of Mathematics and its Applications</EM>,
82  13:117-119, 1974.
83
84<P></P><DT><A NAME="dijkstra59">10</A>
85<DD>
86E.&nbsp;Dijkstra.
87<BR>A note on two problems in connexion with graphs.
88<BR><EM>Numerische Mathematik</EM>, 1:269-271, 1959.
89
90<P></P><DT><A NAME="ford62:_flows">11</A>
91<DD>
92L.&nbsp;R. Ford and D.&nbsp;R. Fulkerson.
93<BR><EM>Flows in networks</EM>.
94<BR>Princeton University Press, 1962.
95
96<P></P><DT><A NAME="gamma95:_design_patterns">12</A>
97<DD>
98E.&nbsp;Gamma, R.&nbsp;Helm, R.&nbsp;Johnson, and J.&nbsp;Vlissides.
99<BR><EM>Design Patterns: Elements of Reusable Object-Oriented Software</EM>.
100<BR>Professional Computing. Addison-Welsey, 1995.
101
102<P></P><DT><A NAME="george93:graphtheory">13</A>
103<DD>
104A.&nbsp;George, J.&nbsp;R. Gilbert, and J.&nbsp;W. Liu, editors.
105<BR><EM>Graph Theory and Sparse Matrix Computation</EM>.
106<BR>Springer-Verlag New York, Inc, 1993.
107
108<P></P><DT><A NAME="george81:__sparse_pos_def">14</A>
109<DD>
110A.&nbsp;George and J.&nbsp;W.-H. Liu.
111<BR><EM>Computer Solution of Large Sparse Positive Definite Systems</EM>.
112<BR>Computational Mathematics. Prentice-Hall, 1981.
113
114<P></P><DT><A NAME="graham85">15</A>
115<DD>
116R.&nbsp;Graham and P.&nbsp;Hell.
117<BR>On the history of the minimum spanning tree problem.
118<BR><EM>Annals of the History of Computing</EM>, 7(1):43-57, 1985.
119
120<P></P><DT><A NAME="hart68">16</A>
121<DD>
122P.&nbsp;E. Hart, N.&nbsp;J. Nilsson, and B.&nbsp;Raphael.
123<BR>A formal basis for the heuristic determination of minimum cost paths.
124<BR><EM>IEEE Transactions on Systems Science and Cybernetics</EM>,
125  4(2):100-107, 1968.
126
127<P></P><DT><A NAME="kruskal56">18</A>
128<DD>
129J.&nbsp;B. Kruskal.
130<BR>On the shortest spanning subtree of a graph and the traveling
131  salesman problem.
132<BR>In <EM>Proceedings of the American Mathematical Sofiety</EM>, volume&nbsp;7,
133  pages 48-50, 1956.
134
135<P></P><DT><A NAME="kuehl96:_design_patterns_for_graph_algo">19</A>
136<DD>
137D.&nbsp;K&#252;hl.
138<BR>Design patterns for the implementation of graph algorithms.
139<BR>Master's thesis, Technische Universit&#228;t Berlin, July 1996.
140
141<P></P><DT><A NAME="lawler76:_comb_opt">20</A>
142<DD>
143E.&nbsp;L. Lawler.
144<BR><EM>Combinatorial Opimization: Networks and Matroids</EM>.
145<BR>Holt, Rinehart, and Winston, 1976.
146
147<P></P><DT><A NAME="LIU:MMD">21</A>
148<DD>
149J.&nbsp;W.&nbsp;H. Liu.
150<BR>Modification of the minimum-degree algorithm by multiple elimination.
151<BR><EM>ACM Transaction on Mathematical Software</EM>, 11(2):141-153, 1985.
152
153<P></P><DT><A NAME="mehlhorn99:_leda">22</A>
154<DD>
155K.&nbsp;Mehlhorn and S.&nbsp;Näher.
156<BR><EM>The LEDA Platform of Combinatorial and Geometric Computing</EM>.
157<BR>Cambridge University Press, 1999.
158
159<P></P><DT><A NAME="meyer88:_object_soft_const">23</A>
160<DD>
161B.&nbsp;Meyer.
162<BR><EM>Object-oriented Software Construction</EM>.
163<BR>Prentice Hall International Series in Computer Science. Prentice
164  Hall, 1988.
165
166<P></P><DT><A NAME="myers95:_trait">24</A>
167<DD>
168N.&nbsp;C. Myers.
169<BR>Traits: a new and useful template technique.
170<BR><EM>C++ Report</EM>, June 1995.
171
172<P></P><DT><A NAME="prim57:_short">25</A>
173<DD>
174R.&nbsp;Prim.
175<BR>Shortest connection networks and some generalizations.
176<BR><EM>Bell System Technical Journal</EM>, 36:1389-1401, 1957.
177
178<P></P><DT><A NAME="saad96:imsms">26</A>
179<DD>
180Y.&nbsp;Saad.
181<BR><EM>Iterative Methods for Sparse Minear System</EM>.
182<BR>PWS Publishing Company, 1996.
183
184<P></P><DT><A NAME="tarjan83:_data_struct_network_algo">27</A>
185<DD>
186R.&nbsp;E. Tarjan.
187<BR><EM>Data Structures and Network Algorithms</EM>.
188<BR>Society for Industrial and Applied Mathematics, 1983.
189
190<P></P><DT><A NAME="parter61:_gauss">28</A>
191<DD>
192Seymour Parter.
193<BR><EM>The use of linear graphs in Gauss elimination</EM>.
194<BR>SIAM Review, 1961 3:119-130.
195
196<P></P><DT><A NAME="matula72:_graph_theory_computing">29</A>
197<DD>
198D. Matula, G. Marble, and J. Isaacson
199<BR><EM>Graph coloring algorithms in Graph Theory and
200Computing</EM>.<BR>
201Academic Press, pp.104-122, 1972.
202
203<P></P><DT><A NAME="garey79:computers-and-intractability">30</a>
204<DD>
205M.R. Garey and D.S. Johnson<BR>
206<EM>Computers and Intractibility: A Guide to the Theory of
207NP-Completeness</EM><BR>
208W.H. Freeman, New York, 1979.
209
210<P></P><DT><A NAME="welsch67">31</a>
211<DD>D. Welsch and M. B. Powel<BR>
212<EM>An upper bound for the chromatic number of a graph and its
213application to timetabling problems</EM>
214Computer Journal, 10:85-86, 1967.
215
216<P></P><DT><A NAME="brelaz79:_new">32</a>
217<DD>D. Br'elaz<BR>
218<EM>New methods to color the vertices of a graph</EM><br>
219Communications of the ACM, vol. 22, 1979, pp. 251-256.
220
221<P></P><DT><A NAME="heber99:_saw">33</a>
222<DD>G. Heber, R. Biswas, G.R. Gao<BR>
223<EM>Self-Avoiding Walks over Adaptive Unstructured Grids</EM><br>
224Parallel and Distributed Processing, LNCS 1586,
225Springer-Verlag, 1999, pp. 968-977
226
227
228<P></P><DT><A NAME="ng-raghavan">34</a>
229<DD>Esmond G. Ng amd Padma Raghavan<BR>
230<EM>Performance of greedy ordering heuristics for sparse {C}holesky factorization</EM><br>
231SIAM Journal on Matrix Analysis and Applications (To appear)
232
233<P></P><DT><A NAME="George:evolution">35</a>
234<DD>Alan George and Joseph W. H. Liu<BR>
235<EM>The Evolution of the Minimum Degree Ordering Algorithm</EM><br>
236SIAM Review, March 1989, vol. 31, num. 1, pp. 1-19.
237
238<P></P><DT><A NAME="ford56:_maxim">36</a>
239<DD>L. R. Ford and D. R. Fulkerson<BR>
240<EM>Maximal flow through a network.</EM><br>
241Can. Journal of Mathematics 1956 pp.399-404
242
243<P></P><DT><A NAME="goldberg85:_new_max_flow_algor">37</a>
244<DD>A. V. Goldberg<BR>
245<EM>A New Max-Flow Algorithm.</EM><br>
246MIT Tehnical report MIT/LCS/TM-291, 1985.
247
248<P></P><DT><A NAME="karzanov74:_deter">38</a>
249<DD>A. V. Karzanov<BR>
250<EM>Determining the maximal flow in a network by the method of preflows.</EM><br>
251Sov. Math. Dokl. 1974
252
253<P></P><DT><A NAME="ahuja93:_network_flows">39</a>
254<DD>Ravindra K. Ahuja and Thomas L. Magnanti and James B. Orlin<BR>
255<EM>Network Flows: Theory, Algorithms, and Applications.</EM><br>
256Prentice Hall, 1993.
257
258<P></P><DT><A NAME="edmonds72:_improvements_netflow">40</a>
259<DD>Jack Edmonds and Richard M. Karp<BR>
260<EM>Theoretical improvements in the algorithmic efficiency for network flow problems.</EM><br>
261Journal of the ACM, 1972 19:248-264
262
263<P></P><DT><A NAME="tarjan72:dfs_and_linear_algo">41</a>
264<DD>Robert E. Tarjan<BR>
265<EM>Depth first search and linear graph algorithms.</EM><br>
266SIAM Journal on Computing, 1(2):146-160, 1972
267
268<P></P><DT><A NAME="eppstein97:dynamic_graph">42</a>
269<DD>David Eppstein, Zvi Galil, and Giuseppe F. Italiano<BR>
270<EM>Dynamic Graph Algorithms.</EM><br>
271Chapter 22, CRC Handbook of Algorithms and Theory of Computation, 1997.
272
273<P></P><DT><A NAME="cuthill69:reducing_bandwith">43</a>
274<DD>E. Cuthill and J. McKee<BR>
275<EM>Reducing the bandwidth of sparse symmetric matrices.</EM><br>
276Proceedings of the 24th National Conference of the ACM, 1969.
277
278<P></P><DT><A NAME="liu75:anal_cm_rcm">44</a>
279<DD>J. Liu and A. Sherman<BR>
280<EM>Comparative analysis of the Cuthill-Mckee and the reverse
281Cuthill-Mckee ordering algorithms for sparse matrices.</EM><br>
282SIAM Journal of Numerical Analysis. 13 (1975), pp. 198-213.
283
284<P></P><DT><A NAME="george71:fem">45</a>
285<DD>Alan George<BR>
286<EM>Computer implementation of the finite element method</EM><br>
287Technical Report STAN-CS-208, Stanford University (1971).
288
289<P></P><DT><A NAME="fortin96:_graph_iso_prob">46</a>
290<DD>Scott Fortin<BR>
291<EM>The Graph Isomorphism Problem</EM><br>
292TR 96-20, Dept. of Computer Science, University of Alberta (1996)
293
294<P></P><DT><A NAME="mckay81:_pract_graph_iso">47</a>
295<DD>Brendan D. McKay<BR>
296<EM>Practical Graph Isomorphism</EM><br>
297Congressus Numerantium (1981)
298
299<P></P><DT><A NAME="reingold77:_combin_algo">48</a>
300<DD>Reingold, Nievergelt, and Deo<BR>
301<EM>Combinatorial Algorithms: Theory and Practice</EM><br>
302Prentice Hall (1977)
303
304<P></P><DT><A NAME="moore59">49</a>
305<DD>Edward Moore<BR>
306<EM>The shortest path through a maze</EM><br>
307International Symposium on the Theory of Switching (1959)<br>
308Harvard University Press
309
310<P></P><DT><A NAME="nuutila95">50</a>
311<DD>E. Nuutila<BR>
312<EM>Efficient transitive closure computation in large digraphs</EM><br>
313PhD Thesis, Helsinki University of Technology, 1995. <br>
314Acta Polytechnica Scandinavica, Mathematics and Computing in
315Engineering Series, No. 74.
316
317<P></P><DT><A NAME="goral79">51</a>
318<DD>A. Goralcikova and V. Koubek<BR>
319<EM>A reduct and closure algorithm for graphs</EM><br>
320In Mathematical Foundations of Computer Science, <br>
321volume 74 of Lecture Notes in Computer Science, pages 301-307. <br>
322Springer-Verlag, 1979
323
324<P></P><DT><A NAME="simon86">52</a>
325<DD>Klaus Simon<BR>
326<EM>An Improved Algorithm for Transitive Closure on Acyclic Digraphs</EM><br>
327Theoretical Computer Science 58<br>
328Automata, Languages and Programming, 376-386, 1986
329
330<P></P><DT><A NAME="purdom70">53</a>
331<DD>P. Purdom<BR>
332<EM>A Transitive Closure Algorithm</EM><br>
333BIT, 10, 1970, pp. 76-94.
334
335<p></p><dt><a name="brandes01">54</a>
336<dd>Ulrik Brandes<br>
337<em><a href="http://ella.slis.indiana.edu/~katy/L579/brandes.pdf">A
338            Faster Algorithm for Betweenness Centrality</a></em><br>
339Journal of Mathematical Sociology 25 (2):163-177, 2001.
340
341<p></p><dt><a name="freeman77">55</a>
342<dd>Lindon C. Freeman<br>
343<em>A Set of Measures of Centrality Based on Betweenness</em><br>
344Sociometry 40, pp. 35-41, 1977.
345
346<p></p><dt><a name="anthonisse71">56</a>
347<dd>J.M. Anthonisse<br>
348<em>The rush in a directed graph.</em><br>
349Technical Report BN9/71, Stichting Mahtematisch Centrum, Amsterdam, 1971.
350
351<p></p><dt><a name="kamada89">57</a>
352<dd>T. Kamada and S. Kawai<br>
353<em>An algorithm for drawing general undirected graphs.</em><br>
354Information Processing Letters, 31, pp. 7-15, 1989.
355
356<p></p><dt><a name="fruchterman91">58</a>
357<dd>T. Fruchterman and E. Reingold<br>
358  <em>Graph drawing by force-directed placement.</em><br>
359Software--Practice & Experience, 21 (11), pp. 1129-1164, 1991.
360
361<p></p><dt><a name="coleman83">59</a>
362<dd>Thomas F. Coleman and Jorge J. More<br>
363  <em>Estimation of sparse Jacobian
364   matrices and graph coloring problems.</em><br>
365  Journal of Numerical Analasis V20, pp. 187-209, 1983.
366
367<p></p><dt><a name="gursoy00">60</a>
368<dd>Attila G&uuml;rsoy and Murat Atun<br>
369  <em>Neighborhood Preserving Load Balancing: A Self-Organizing Approach</em>
370  <br>
371  Euro-Par Parallel Processing, LNCS 1900, pp. 324-41, 2000.
372
373<p></p><dt><a name="driscoll88">61</a>
374<dd>James R. Driscoll, Harold N. Gabow, Ruth Shrairman, and Robert E. Tarjan<br>
375  <em>Relaxed Heaps: An alternative for Fibonacci Heaps with applications to parallel computation.</em><br>
376  Communications of the ACM, 31 (11), pp. 1343-1354, November 1988.
377
378<p></p><dt><a name="king70">62</a>
379<dd>King, I. P.<br>
380<em>An automatic reordering scheme for simultaneous equations derived from network analysis.</em><br>
381Int. J. Numer. Methods Engrg. 2, pp. 523-533, 1970.
382 
383<p></p><dt><a name="palmer2000">63</a>
384<dd>C. Palmer and J. Steffan<br>
385<em>Generating Network Topologies That Obey Power Laws</em><br>
386Proceedings of GLOBECOM. November, 2000.
387
388</dl>
389 
390<br>
391<HR>
392<TABLE>
393<TR valign=top>
394<TD nowrap>Copyright &copy 2000-2001</TD><TD>
395<A HREF="../../../people/jeremy_siek.htm">Jeremy Siek</A>, Indiana University (<A HREF="mailto:jsiek@osl.iu.edu">jsiek@osl.iu.edu</A>)
396</TD></TR></TABLE>
397
398</BODY>
399</HTML> 
Note: See TracBrowser for help on using the repository browser.