COIN-OR::LEMON - Graph Library

Ignore:
Timestamp:
03/18/13 17:41:19 (11 years ago)
Author:
Alpar Juttner <alpar@…>
Branch:
default
Phase:
public
Message:

Use doxygen's own bibtex support (#456)

File:
1 edited

Legend:

Unmodified
Added
Removed
  • lemon/grosso_locatelli_pullan_mc.h

    r1022 r1221  
    4141  /// \ref GrossoLocatelliPullanMc implements the iterated local search
    4242  /// algorithm of Grosso, Locatelli, and Pullan for solving the \e maximum
    43   /// \e clique \e problem \ref grosso08maxclique.
     43  /// \e clique \e problem \cite grosso08maxclique.
    4444  /// It is to find the largest complete subgraph (\e clique) in an
    4545  /// undirected graph, i.e., the largest set of nodes where each
Note: See TracChangeset for help on using the changeset viewer.