boost-react-native-bundle

<HTML>  <Head> <Title>Boost Graph Library: Bibliography</Title> <BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b" ALINK="#ff0000"> <IMG SRC="../../../boost.png" ALT="C++ Boost" width="277" height="86"> <H2>Bibliography</H2> <DL COMMapCT><DD><DT><A NAME="aho83:_data_struct_algo">1</A> <DD> A. V. Aho, J. E. Hopcroft, and J. D. Ullman. Data Structures and Algorithms. Addison-Wesley, 1983. <DT><A NAME="austern99:_gener_progr_stl">2</A> <DD> M. H. Austern. Generic Programming and the STL. Professional computing series. Addison-Wesley, 1999. <DT><A NAME="baumgartner95:_signatures">3</A> <DD> G. Baumgartner and V. F. Russo. Signatures: A language extension for improving type abstraction and subtype polymorphism in C++. Software-Practice and Experience, 25(8):863-889, August 1995. <DT><A NAME="bellman58">4</A> <DD> R. Bellman. On a routing problem. Quarterly of Applied Mathematics, 16(1):87-90, 1958. <DT><A NAME="bruce95">5</A> <DD> K. B. Bruce, L. Cardelli, G. Castagna, the Hopkins Objects Group, G. T. Leavens, and B. Pierce. On binary methods. Theory and Practice of Object Systems, 1:221-242, 1995. <DT><A NAME="coleman85:_algor">6</A> <DD> T. F. Coleman, B. S. Garbow, and J. J. Mor'e. Algorithm 649: Fortran subroutines for estimating sparse hessian matrices. ACM Transactions on Mathematical Software, 11(4):378, December 1985. <DT><A NAME="coleman84:_estim_jacob">7</A> <DD> T. F. Coleman and J. J. Mor'e. Estimation of sparse jacobian matrices and graph coloring problems. SIAM Journal on Numerical Analysis, 20:187-209,, 1984. <DT><A NAME="clr90">8</A> <DD> T. Cormen, C. Leiserson, and R. Rivest. Introduction to Algorithms. McGraw-Hill, 1990. <DT><A NAME="curtis74:_jacob">9</A> <DD> A. Curtis, M. Powell, and J. Reid. On the estimation of sparse jacobian matrices. Journal of the Institute of Mathematics and its Applications, 13:117-119, 1974. <DT><A NAME="dijkstra59">10</A> <DD> E. Dijkstra. A note on two problems in connexion with graphs. Numerische Mathematik, 1:269-271, 1959. <DT><A NAME="ford62:_flows">11</A> <DD> L. R. Ford and D. R. Fulkerson. Flows in networks. Princeton University Press, 1962. <DT><A NAME="gamma95:_design_patterns">12</A> <DD> E. Gamma, R. Helm, R. Johnson, and J. Vlissides. Design Patterns: Elements of Reusable Object-Oriented Software. Professional Computing. Addison-Welsey, 1995. <DT><A NAME="george93:graphtheory">13</A> <DD> A. George, J. R. Gilbert, and J. W. Liu, editors. Graph Theory and Sparse Matrix Computation. Springer-Verlag New York, Inc, 1993. <DT><A NAME="george81:__sparse_pos_def">14</A> <DD> A. George and J. W.-H. Liu. Computer Solution of Large Sparse Positive Definite Systems. Computational Mathematics. Prentice-Hall, 1981. <DT><A NAME="graham85">15</A> <DD> R. Graham and P. Hell. On the history of the minimum spanning tree problem. Annals of the History of Computing, 7(1):43-57, 1985. <DT><A NAME="hart68">16</A> <DD> P. E. Hart, N. J. Nilsson, and B. Raphael. A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems Science and Cybernetics, 4(2):100-107, 1968. <DT><A NAME="kruskal56">18</A> <DD> J. B. Kruskal. On the shortest spanning subtree of a graph and the traveling salesman problem. In Proceedings of the American Mathematical Sofiety, volume 7, pages 48-50, 1956. <DT><A NAME="kuehl96:_design_patterns_for_graph_algo">19</A> <DD> D. Kühl. Design patterns for the implementation of graph algorithms. Master's thesis, Technische Universität Berlin, July 1996. <DT><A NAME="lawler76:_comb_opt">20</A> <DD> E. L. Lawler. Combinatorial Opimization: Networks and Matroids. Holt, Rinehart, and Winston, 1976. <DT><A NAME="LIU:MMD">21</A> <DD> J. W. H. Liu. Modification of the minimum-degree algorithm by multiple elimination. ACM Transaction on Mathematical Software, 11(2):141-153, 1985. <DT><A NAME="mehlhorn99:_leda">22</A> <DD> K. Mehlhorn and S. N�her. The LEDA Platform of Combinatorial and Geometric Computing. Cambridge University Press, 1999. <DT><A NAME="meyer88:_object_soft_const">23</A> <DD> B. Meyer. Object-oriented Software Construction. Prentice Hall International Series in Computer Science. Prentice Hall, 1988. <DT><A NAME="myers95:_trait">24</A> <DD> N. C. Myers. Traits: a new and useful template technique. C++ Report, June 1995. <DT><A NAME="prim57:_short">25</A> <DD> R. Prim. Shortest connection networks and some generalizations. Bell System Technical Journal, 36:1389-1401, 1957. <DT><A NAME="saad96:imsms">26</A> <DD> Y. Saad. Iterative Methods for Sparse Minear System. PWS Publishing Company, 1996. <DT><A NAME="tarjan83:_data_struct_network_algo">27</A> <DD> R. E. Tarjan. Data Structures and Network Algorithms. Society for Industrial and Applied Mathematics, 1983. <DT><A NAME="parter61:_gauss">28</A> <DD> Seymour Parter. The use of linear graphs in Gauss elimination. SIAM Review, 1961 3:119-130. <DT><A NAME="matula72:_graph_theory_computing">29</A> <DD> D. Matula, G. Marble, and J. Isaacson Graph coloring algorithms in Graph Theory and Computing. Academic Press, pp.104-122, 1972. <DT><A NAME="garey79:computers-and-intractability">30</a> <DD> M.R. Garey and D.S. Johnson Computers and Intractibility: A Guide to the Theory of NP-Completeness W.H. Freeman, New York, 1979. <DT><A NAME="welsch67">31</a> <DD>D. Welsch and M. B. Powel An upper bound for the chromatic number of a graph and its application to timetabling problems Computer Journal, 10:85-86, 1967. <DT><A NAME="brelaz79:_new">32</a> <DD>D. Br'elaz New methods to color the vertices of a graph Communications of the ACM, vol. 22, 1979, pp. 251-256. <DT><A NAME="heber99:_saw">33</a> <DD>G. Heber, R. Biswas, G.R. Gao Self-Avoiding Walks over Adaptive Unstructured Grids Parallel and Distributed Processing, LNCS 1586, Springer-Verlag, 1999, pp. 968-977 <DT><A NAME="ng-raghavan">34</a> <DD>Esmond G. Ng amd Padma Raghavan Performance of greedy ordering heuristics for sparse {C}holesky factorization SIAM Journal on Matrix Analysis and Applications (To appear) <DT><A NAME="George:evolution">35</a> <DD>Alan George and Joseph W. H. Liu The Evolution of the Minimum Degree Ordering Algorithm SIAM Review, March 1989, vol. 31, num. 1, pp. 1-19. <DT><A NAME="ford56:_maxim">36</a> <DD>L. R. Ford and D. R. Fulkerson Maximal flow through a network. Can. Journal of Mathematics 1956 pp.399-404 <DT><A NAME="goldberg85:_new_max_flow_algor">37</a> <DD>A. V. Goldberg A New Max-Flow Algorithm. MIT Tehnical report MIT/LCS/TM-291, 1985. <DT><A NAME="karzanov74:_deter">38</a> <DD>A. V. Karzanov Determining the maximal flow in a network by the method of preflows. Sov. Math. Dokl. 1974 <DT><A NAME="ahuja93:_network_flows">39</a> <DD>Ravindra K. Ahuja and Thomas L. Magnanti and James B. Orlin Network Flows: Theory, Algorithms, and Applications. Prentice Hall, 1993. <DT><A NAME="edmonds72:_improvements_netflow">40</a> <DD>Jack Edmonds and Richard M. Karp Theoretical improvements in the algorithmic efficiency for network flow problems. Journal of the ACM, 1972 19:248-264 <DT><A NAME="tarjan72:dfs_and_linear_algo">41</a> <DD>Robert E. Tarjan Depth first search and linear graph algorithms. SIAM Journal on Computing, 1(2):146-160, 1972 <DT><A NAME="eppstein97:dynamic_graph">42</a> <DD>David Eppstein, Zvi Galil, and Giuseppe F. Italiano Dynamic Graph Algorithms. Chapter 22, CRC Handbook of Algorithms and Theory of Computation, 1997. <DT><A NAME="cuthill69:reducing_bandwith">43</a> <DD>E. Cuthill and J. McKee Reducing the bandwidth of sparse symmetric matrices. Proceedings of the 24th National Conference of the ACM, 1969. <DT><A NAME="liu75:anal_cm_rcm">44</a> <DD>J. Liu and A. Sherman Comparative analysis of the Cuthill-Mckee and the reverse Cuthill-Mckee ordering algorithms for sparse matrices. SIAM Journal of Numerical Analysis. 13 (1975), pp. 198-213. <DT><A NAME="george71:fem">45</a> <DD>Alan George Computer implementation of the finite element method Technical Report STAN-CS-208, Stanford University (1971). <DT><A NAME="fortin96:_graph_iso_prob">46</a> <DD>Scott Fortin The Graph Isomorphism Problem TR 96-20, Dept. of Computer Science, University of Alberta (1996) <DT><A NAME="mckay81:_pract_graph_iso">47</a> <DD>Brendan D. McKay Practical Graph Isomorphism Congressus Numerantium (1981) <DT><A NAME="reingold77:_combin_algo">48</a> <DD>Reingold, Nievergelt, and Deo Combinatorial Algorithms: Theory and Practice Prentice Hall (1977) <DT><A NAME="moore59">49</a> <DD>Edward Moore The shortest path through a maze International Symposium on the Theory of Switching (1959) Harvard University Press <DT><A NAME="nuutila95">50</a> <DD>E. Nuutila Efficient transitive closure computation in large digraphs PhD Thesis, Helsinki University of Technology, 1995. Acta Polytechnica Scandinavica, Mathematics and Computing in Engineering Series, No. 74. <DT><A NAME="goral79">51</a> <DD>A. Goralcikova and V. Koubek A reduct and closure algorithm for graphs In Mathematical Foundations of Computer Science, volume 74 of Lecture Notes in Computer Science, pages 301-307. Springer-Verlag, 1979 <DT><A NAME="simon86">52</a> <DD>Klaus Simon An Improved Algorithm for Transitive Closure on Acyclic Digraphs Theoretical Computer Science 58 Automata, Languages and Programming, 376-386, 1986 <DT><A NAME="purdom70">53</a> <DD>P. Purdom A Transitive Closure Algorithm BIT, 10, 1970, pp. 76-94. <dt><a name="brandes01">54</a> <dd>Ulrik Brandes <a href="http://ella.slis.indiana.edu/~katy/L579/brandes.pdf">A Faster Algorithm for Betweenness Centrality</a> Journal of Mathematical Sociology 25 (2):163-177, 2001. <dt><a name="freeman77">55</a> <dd>Lindon C. Freeman A Set of Measures of Centrality Based on Betweenness Sociometry 40, pp. 35-41, 1977. <dt><a name="anthonisse71">56</a> <dd>J.M. Anthonisse The rush in a directed graph. Technical Report BN9/71, Stichting Mahtematisch Centrum, Amsterdam, 1971. <dt><a name="kamada89">57</a> <dd>T. Kamada and S. Kawai An algorithm for drawing general undirected graphs. Information Processing Letters, 31, pp. 7-15, 1989. <dt><a name="fruchterman91">58</a> <dd>T. Fruchterman and E. Reingold Graph drawing by force-directed placement. Software--Practice & Experience, 21 (11), pp. 1129-1164, 1991. <dt><a name="coleman83">59</a> <dd>Thomas F. Coleman and Jorge J. More Estimation of sparse Jacobian matrices and graph coloring problems. Journal of Numerical Analasis V20, pp. 187-209, 1983. <dt><a name="gursoy00">60</a> <dd>Attila Gürsoy and Murat Atun Neighborhood Preserving Load Balancing: A Self-Organizing Approach Euro-Par Parallel Processing, LNCS 1900, pp. 324-41, 2000. <dt><a name="driscoll88">61</a> <dd>James R. Driscoll, Harold N. Gabow, Ruth Shrairman, and Robert E. Tarjan Relaxed Heaps: An alternative for Fibonacci Heaps with applications to parallel computation. Communications of the ACM, 31 (11), pp. 1343-1354, November 1988. <dt><a name="king70">62</a> <dd>King, I. P. An automatic reordering scheme for simultaneous equations derived from network analysis. Int. J. Numer. Methods Engrg. 2, pp. 523-533, 1970. <dt><a name="palmer2000">63</a> <dd>C. Palmer and J. Steffan Generating Network Topologies That Obey Power Laws Proceedings of GLOBECOM. November, 2000. <dt><a name="edmonds65">64</a> <dd>J. Edmonds Paths, trees, and flowers Canadian Journal of Mathematics 17 (1965), pp. 449-467. <dt><a name="lengauer-tarjan79">65</a> <dd>Thomas Lengauer and Robert Endre Tarjan A fast algorithm for finding dominators in a flowgraph ACM Transactions on Programming Language and Systems, 1(1):121-141, 1979. <dt><a name="muchnick97">66</a> <dd>Steven S. Muchnick Advanced Compiler Design and Implementation Morgan Kaufmann Publishers, San Fransisco, 1997. <dt><a name="appel98">67</a> <dd>Andrew W. Appel Modern Compiler Implementation in JAVA Cambridge University Press, 1998. <dt><a name="kolmogorov03">68</a> <dd>Vladimir Kolmogorov Graph Based Algorithms for Scene Reconstruction from Two or More Views PhD thesis, Cornell University, September 2003. <dt><a name="boykov-kolmogorov04">69</a> <dd>Yuri Boykov and Vladimir Kolmogorov <a href="http://www.csd.uwo.ca/faculty/yuri/Abstracts/pami04-abs.html">An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision</a> In IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 26, no. 9, pp. 1124-1137, Sept. 2004. <dt><a name="boyermyrvold04">70</a> <dd>John M. Boyer and Wendy J. Myrvold <a href="http://www.emis.de/journals/JGAA/accepted/2004/BoyerMyrvold2004.8.3.pdf"> On the Cutting Edge: Simplified O(n) Planarity by Edge Addition</a> Journal of Graph Algorithms and Applications, 8(2): 241-273, 2004. <dt><a name="chrobakpayne95">71</a> <dd>M. Chrobak, T. Payne A Linear-time Algorithm for Drawing a Planar Graph on the Grid Information Processing Letters 54: 241-246, 1995. <dt><a name="defraysseixpachpollack90">72</a> <dd>H. de Fraysseix, J. Pach, R. Pollack How to Draw a Planar Graph on a Grid Combinatorica 10: 41-51, 1990. <DT><A NAME="wilson96generating">73</A> <DD> David Bruce Wilson Generating random spanning trees more quickly than the cover time. ACM Symposium on the Theory of Computing, pp. 296-303, 1996. </dl> <HR> <TABLE> <TR valign=top> <TD nowrap>Copyright © 2000-2001</TD><TD> <A HREF="http://www.boost.org/people/jeremy_siek.htm">Jeremy Siek</A>, Indiana University (<A HREF="mailto:jsiek@osl.iu.edu">jsiek@osl.iu.edu</A>) </TD></TR></TABLE> </BODY> </HTML>