The Boost Graph Library - User Guide and Reference Manual

By Jeremy G. Siek, Lie-Quan Lee, Andrew Lumsdaine. C++ in-depth series, 2001

794 citations recorded by the source corpus.

View Paper: https://www.semanticscholar.org/paper/bd014331774ef7becae11a3c8af5005b3a75630d

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Citations in the corpus

The Combinatorial BLAS: design, implementation, and applications (2011, methodology): “The Parallel Boost Graph Library (PBGL) (Gregor and Lumsdaine, 2005) is a parallel library for distributed memory computing on graphs.”
Gunrock: a high-performance graph processing library on the GPU (2015, methodology): “We compare Gunrock’s performance with three CPU graph libraries: the Boost Graph Library (BGL) [29], one of the highest-performing CPU single-threaded graph libraries [20]; PowerGraph, a popular distributed graph library [12]; and Ligra, one of the highest-performing multi-core shared-memory graph…”
The Algorithm Design Manual (2020, methodology): “This means the Boost Graph Library [SLL02] (http://www.”
Pregel: a system for large-scale graph processing (2010, methodology): “Using a single-computer graph algorithm library, such as BGL [43], LEDA [35], NetworkX [25], JDSL [20], Stanford GraphBase [29], or FGL [16], limiting the scale of problems that can be addressed.”
Integrating landscape connectivity in broad-scale forest planning through a new graph-based habitat availability methodology: application to capercaillie (Tetrao urogallus) in Catalonia (NE Spain) (2006, methodology): “…ai aj 1þnlij A2L ð1Þ where ai is the descriptive variable of each forest habitat area (node) and nlij is the number of links in the shortest path (topological distance) between nodes i and j, calculated through the BFS (breadth-first search) graph algorithm (Cormen et al. 2001; Siek et al. 2001).”
Green-Marl: a DSL for easy and efficient graph analysis (2012, background): “Popular single-threaded libraries include the Boost Graph Library(BGL) [33] and igraph [18].”
The ALPS project release 2.0: open source software for strongly correlated systems (2011, methodology): “To give just one example, the lattice library, implemented generically using C++ template features, is based on the Boost Graph Library[48, 49] (BGL) and does not restrict the user to a speciﬁc data structure as in C or Fortran libraries.”
Mash: fast genome and metagenome distance estimation using MinHash (2015, methodology): “If needed, Mash can also be built using the Boost library [60] to avoid the GSL (GPLv3) license requirements.”
A visual analytics approach to understanding cycling behaviour (2012, unknown): “It is observed that the rate of deformation increases with the We number in agreement with the experiment of [7] and the numerical studies of [18] and [20].”