|
Boost-Commit : |
From: asutton_at_[hidden]
Date: 2007-08-03 09:21:18
Author: asutton
Date: 2007-08-03 09:21:18 EDT (Fri, 03 Aug 2007)
New Revision: 38416
URL: http://svn.boost.org/trac/boost/changeset/38416
Log:
Writing more detailed bib data for the cores algorithm.
Text files modified:
sandbox/SOC/2007/graphs/boost/graph/core_numbers.hpp | 12 ++++++++++--
1 files changed, 10 insertions(+), 2 deletions(-)
Modified: sandbox/SOC/2007/graphs/boost/graph/core_numbers.hpp
==============================================================================
--- sandbox/SOC/2007/graphs/boost/graph/core_numbers.hpp (original)
+++ sandbox/SOC/2007/graphs/boost/graph/core_numbers.hpp 2007-08-03 09:21:18 EDT (Fri, 03 Aug 2007)
@@ -28,8 +28,16 @@
// numbers of a weighted graph.
//
// The linear algorithm comes from:
- // Vladimir Batagelj and Matjaz Zaversnik, "An O(m) Algorithm for Cores
- // Decomposition of Networks." Sept. 1 2002.
+ // @article{DBLP:journals/corr/cs-DS-0310049,
+ // author = {Vladimir Batagelj and Matjaz Zaversnik},
+ // title = {An O(m) Algorithm for Cores Decomposition of Networks},
+ // journal = {The Computing Research Repository (CoRR)},
+ // volume = {cs.DS/0310049},
+ // year = {2003},
+ // ee = {http://arxiv.org/abs/cs.DS/0310049},
+ // bibsource = {DBLP, http://dblp.uni-trier.de}
+ // }
+
namespace detail
{
Boost-Commit list run by bdawes at acm.org, david.abrahams at rcn.com, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk