doc/references.bib
author Alpar Juttner <alpar@cs.elte.hu>
Wed, 17 Oct 2018 22:55:02 +0200
changeset 1414 73e29215aaa4
parent 1367 233ad6942a26
permissions -rw-r--r--
Add citation for Vf2pp (#597)
     1 %%%%% Defining LEMON %%%%%
     2 
     3 @misc{lemon,
     4   key =          {LEMON},
     5   title =        {{LEMON} -- {L}ibrary for {E}fficient {M}odeling and
     6                   {O}ptimization in {N}etworks},
     7   howpublished = {\url{http://lemon.cs.elte.hu/}}
     8 }
     9 
    10 @misc{egres,
    11   key =          {EGRES},
    12   title =        {{EGRES} -- {E}gerv{\'a}ry {R}esearch {G}roup on
    13                   {C}ombinatorial {O}ptimization},
    14   url =          {http://www.cs.elte.hu/egres/}
    15 }
    16 
    17 @misc{coinor,
    18   key =          {COIN-OR},
    19   title =        {{COIN-OR} -- {C}omputational {I}nfrastructure for
    20                   {O}perations {R}esearch},
    21   url =          {http://www.coin-or.org/}
    22 }
    23 
    24 
    25 %%%%% Papers related to LEMON %%%%%
    26 
    27 @article{DezsoJuttnerKovacs11Lemon,
    28   author =       {B. Dezs{\H o} and A. J\"uttner and P. Kov\'acs},
    29   title =        {{LEMON} -- an open source {C++} graph template library},
    30   journal =      {Electronic Notes in Theoretical Computer Science},
    31   volume =       {264},
    32   pages =        {23--45},
    33   year =         {2011},
    34   note =         {Proc. 2nd Workshop on Generative Technologies}
    35 }
    36 
    37 @article{KiralyKovacs12MCF,
    38   author =       {Z. Kir\'aly and P. Kov\'acs},
    39   title =        {Efficient implementations of minimum-cost flow algorithms},
    40   journal =      {Acta Universitatis Sapientiae, Informatica},
    41   year =         {2012},
    42   volume =       {4},
    43   pages =        {67--118}
    44 }
    45 
    46 @article{VF2PP,
    47   author =       {Alp\'ar J\"uttner and  P\'eter Madarasi},
    48   title =        {{VF2++} — An improved subgraph isomorphism algorithm},
    49   journal =      {Discrete Applied Mathematics},
    50   year =         {2018},
    51   volume =       {242},
    52   pages =        {69--81},
    53   url =          {https://doi.org/10.1016/j.dam.2018.02.018}
    54 }
    55 
    56 
    57 
    58 %%%%% Other libraries %%%%%%
    59 
    60 @misc{boost,
    61   key =          {Boost},
    62   title =        {{B}oost {C++} {L}ibraries},
    63   url =          {http://www.boost.org/}
    64 }
    65 
    66 @book{bglbook,
    67   author =       {Jeremy G. Siek and Lee-Quan Lee and Andrew
    68                   Lumsdaine},
    69   title =        {The Boost Graph Library: User Guide and Reference
    70                   Manual},
    71   publisher =    {Addison-Wesley},
    72   year =         2002
    73 }
    74 
    75 @misc{leda,
    76   key =          {LEDA},
    77   title =        {{LEDA} -- {L}ibrary of {E}fficient {D}ata {T}ypes and
    78                   {A}lgorithms},
    79   url =          {http://www.algorithmic-solutions.com/}
    80 }
    81 
    82 @book{ledabook,
    83   author =       {Kurt Mehlhorn and Stefan N{\"a}her},
    84   title =        {{LEDA}: {A} platform for combinatorial and geometric
    85                   computing},
    86   isbn =         {0-521-56329-1},
    87   publisher =    {Cambridge University Press},
    88   address =      {New York, NY, USA},
    89   year =         1999
    90 }
    91 
    92 
    93 %%%%% Tools that LEMON depends on %%%%%
    94 
    95 @misc{cmake,
    96   key =          {CMake},
    97   title =        {{CMake} -- {C}ross {P}latform {M}ake},
    98   url =          {http://www.cmake.org/}
    99 }
   100 
   101 @misc{doxygen,
   102   key =          {Doxygen},
   103   title =        {{Doxygen} -- {S}ource code documentation generator
   104                   tool},
   105   url =          {http://www.doxygen.org/}
   106 }
   107 
   108 
   109 %%%%% LP/MIP libraries %%%%%
   110 
   111 @misc{glpk,
   112   key =          {GLPK},
   113   title =        {{GLPK} -- {GNU} {L}inear {P}rogramming {K}it},
   114   url =          {http://www.gnu.org/software/glpk/}
   115 }
   116 
   117 @misc{clp,
   118   key =          {Clp},
   119   title =        {{Clp} -- {Coin-Or} {L}inear {P}rogramming},
   120   url =          {http://projects.coin-or.org/Clp/}
   121 }
   122 
   123 @misc{cbc,
   124   key =          {Cbc},
   125   title =        {{Cbc} -- {Coin-Or} {B}ranch and {C}ut},
   126   url =          {http://projects.coin-or.org/Cbc/}
   127 }
   128 
   129 @misc{cplex,
   130   key =          {CPLEX},
   131   title =        {{ILOG} {CPLEX}},
   132   url =          {http://www.ilog.com/}
   133 }
   134 
   135 @misc{soplex,
   136   key =          {SoPlex},
   137   title =        {{SoPlex} -- {T}he {S}equential {O}bject-{O}riented
   138                   {S}implex},
   139   url =          {http://soplex.zib.de/}
   140 }
   141 
   142 
   143 %%%%% General books %%%%%
   144 
   145 @book{amo93networkflows,
   146   author =       {Ravindra K. Ahuja and Thomas L. Magnanti and James
   147                   B. Orlin},
   148   title =        {Network Flows: Theory, Algorithms, and Applications},
   149   publisher =    {Prentice-Hall, Inc.},
   150   year =         1993,
   151   month =        feb,
   152   isbn =         {978-0136175490}
   153 }
   154 
   155 @book{schrijver03combinatorial,
   156   author =       {Alexander Schrijver},
   157   title =        {Combinatorial Optimization: Polyhedra and Efficiency},
   158   publisher =    {Springer-Verlag},
   159   year =         2003,
   160   isbn =         {978-3540443896}
   161 }
   162 
   163 @book{clrs01algorithms,
   164   author =       {Thomas H. Cormen and Charles E. Leiserson and Ronald
   165                   L. Rivest and Clifford Stein},
   166   title =        {Introduction to Algorithms},
   167   publisher =    {The MIT Press},
   168   year =         2001,
   169   edition =      {2nd}
   170 }
   171 
   172 @book{stroustrup00cpp,
   173   author =       {Bjarne Stroustrup},
   174   title =        {The C++ Programming Language},
   175   edition =      {3rd},
   176   publisher =    {Addison-Wesley Professional},
   177   isbn =         0201700735,
   178   month =        {February},
   179   year =         2000
   180 }
   181 
   182 
   183 %%%%% Maximum flow algorithms %%%%%
   184 
   185 @article{edmondskarp72theoretical,
   186   author =       {Jack Edmonds and Richard M. Karp},
   187   title =        {Theoretical improvements in algorithmic efficiency
   188                   for network flow problems},
   189   journal =      {Journal of the ACM},
   190   year =         1972,
   191   volume =       19,
   192   number =       2,
   193   pages =        {248-264}
   194 }
   195 
   196 @article{goldberg88newapproach,
   197   author =       {Andrew V. Goldberg and Robert E. Tarjan},
   198   title =        {A new approach to the maximum flow problem},
   199   journal =      {Journal of the ACM},
   200   year =         1988,
   201   volume =       35,
   202   number =       4,
   203   pages =        {921-940}
   204 }
   205 
   206 @article{dinic70algorithm,
   207   author =       {E. A. Dinic},
   208   title =        {Algorithm for solution of a problem of maximum flow
   209                   in a network with power estimation},
   210   journal =      {Soviet Math. Doklady},
   211   year =         1970,
   212   volume =       11,
   213   pages =        {1277-1280}
   214 }
   215 
   216 @article{goldberg08partial,
   217   author =       {Andrew V. Goldberg},
   218   title =        {The Partial Augment-Relabel Algorithm for the
   219                   Maximum Flow Problem},
   220   journal =      {16th Annual European Symposium on Algorithms},
   221   year =         2008,
   222   pages =        {466-477}
   223 }
   224 
   225 @article{sleator83dynamic,
   226   author =       {Daniel D. Sleator and Robert E. Tarjan},
   227   title =        {A data structure for dynamic trees},
   228   journal =      {Journal of Computer and System Sciences},
   229   year =         1983,
   230   volume =       26,
   231   number =       3,
   232   pages =        {362-391}
   233 }
   234 
   235 
   236 %%%%% Minimum mean cycle algorithms %%%%%
   237 
   238 @article{karp78characterization,
   239   author =       {Richard M. Karp},
   240   title =        {A characterization of the minimum cycle mean in a
   241                   digraph},
   242   journal =      {Discrete Math.},
   243   year =         1978,
   244   volume =       23,
   245   pages =        {309-311}
   246 }
   247 
   248 @article{hartmann93finding,
   249   author =       {Mark Hartmann and James B. Orlin},
   250   title =        {Finding minimum cost to time ratio cycles with small
   251                   integral transit times},
   252   journal =      {Networks},
   253   year =         1993,
   254   volume =       23,
   255   pages =        {567-574}
   256 }
   257 
   258 @article{dasdan98minmeancycle,
   259   author =       {Ali Dasdan and Rajesh K. Gupta},
   260   title =        {Faster Maximum and Minimum Mean Cycle Alogrithms for
   261                   System Performance Analysis},
   262   journal =      {IEEE Transactions on Computer-Aided Design of
   263                   Integrated Circuits and Systems},
   264   year =         1998,
   265   volume =       17,
   266   number =       10,
   267   pages =        {889-899}
   268 }
   269 
   270 @article{dasdan04experimental,
   271   author =       {Ali Dasdan},
   272   title =        {Experimental analysis of the fastest optimum cycle
   273                   ratio and mean algorithms},
   274   journal =      {ACM Trans. Des. Autom. Electron. Syst.},
   275   year =         2004,
   276   volume =       9,
   277   issue =        4,
   278   pages =        {385-418}
   279 } 
   280 
   281 
   282 %%%%% Minimum cost flow algorithms %%%%%
   283 
   284 @article{klein67primal,
   285   author =       {Morton Klein},
   286   title =        {A primal method for minimal cost flows with
   287                   applications to the assignment and transportation
   288                   problems},
   289   journal =      {Management Science},
   290   year =         1967,
   291   volume =       14,
   292   pages =        {205-220}
   293 }
   294 
   295 @article{goldberg89cyclecanceling,
   296   author =       {Andrew V. Goldberg and Robert E. Tarjan},
   297   title =        {Finding minimum-cost circulations by canceling
   298                   negative cycles},
   299   journal =      {Journal of the ACM},
   300   year =         1989,
   301   volume =       36,
   302   number =       4,
   303   pages =        {873-886}
   304 }
   305 
   306 @article{goldberg90approximation,
   307   author =       {Andrew V. Goldberg and Robert E. Tarjan},
   308   title =        {Finding Minimum-Cost Circulations by Successive
   309                   Approximation},
   310   journal =      {Mathematics of Operations Research},
   311   year =         1990,
   312   volume =       15,
   313   number =       3,
   314   pages =        {430-466}
   315 }
   316 
   317 @article{goldberg97efficient,
   318   author =       {Andrew V. Goldberg},
   319   title =        {An Efficient Implementation of a Scaling
   320                   Minimum-Cost Flow Algorithm},
   321   journal =      {Journal of Algorithms},
   322   year =         1997,
   323   volume =       22,
   324   number =       1,
   325   pages =        {1-29}
   326 }
   327 
   328 @article{bunnagel98efficient,
   329   author =       {Ursula B{\"u}nnagel and Bernhard Korte and Jens
   330                   Vygen},
   331   title =        {Efficient implementation of the {G}oldberg-{T}arjan
   332                   minimum-cost flow algorithm},
   333   journal =      {Optimization Methods and Software},
   334   year =         1998,
   335   volume =       10,
   336   pages =        {157-174}
   337 }
   338 
   339 @book{dantzig63linearprog,
   340   author =       {George B. Dantzig},
   341   title =        {Linear Programming and Extensions},
   342   publisher =    {Princeton University Press},
   343   year =         1963
   344 }
   345 
   346 @mastersthesis{kellyoneill91netsimplex,
   347   author =       {Damian J. Kelly and Garrett M. O'Neill},
   348   title =        {The Minimum Cost Flow Problem and The Network
   349                   Simplex Method},
   350   school =       {University College},
   351   address =      {Dublin, Ireland},
   352   year =         1991,
   353   month =        sep
   354 }
   355 
   356 %%%%% Other algorithms %%%%%
   357 
   358 @article{grosso08maxclique,
   359   author =       {Andrea Grosso and Marco Locatelli and Wayne Pullan},
   360   title =        {Simple ingredients leading to very efficient
   361                   heuristics for the maximum clique problem},
   362   journal =      {Journal of Heuristics},
   363   year =         2008,
   364   volume =       14,
   365   number =       6,
   366   pages =        {587--612}
   367 }
   368 
   369 @article{cordella2004sub,
   370   author =       {Cordella, Luigi P. and Foggia, Pasquale and Sansone,
   371                   Carlo and Vento, Mario},
   372   title =        {A (sub)graph isomorphism algorithm for matching
   373                   large graphs},
   374   journal =      {IEEE Transactions on Pattern Analysis and Machine
   375                   Intelligence},
   376   volume =       26,
   377   number =       10,
   378   pages =        {1367--1372},
   379   year =         2004
   380 }