BGL

swMATH17557MaRDI QIDQ29415FDOQ29415

Author name not available (Why is that?)

Official website: http://www.boost.org/doc/libs/1_62_0/libs/graph/doc/

Cited In (only showing first 100 items - show all)

• A new dichotomic algorithm for the uniform random generation of words in regular languages
• A generic software design for Delaunay refinement meshing
• A language for generic programming in the large
• Multi-stage programming with functors and monads: eliminating abstraction overhead from generic code
• Extracting unsatisfiable cores for LTL via temporal resolution
• Enhancing unsatisfiable cores for LTL with information on temporal relevance
• An Evaluation of Automata Algorithms for String Analysis
• Treewidth computations. II. Lower bounds
• Minimum-cost flow algorithms: an experimental evaluation
• Models for the single-vehicle preemptive pickup and delivery problem
• Computing large matchings in planar graphs with fixed minimum degree
• Concepts for High-Perfomance Scientific Computing
• Properties of the DGS-auction algorithm
• Modeling wildfire propagation with Delaunay triangulation and shortest path algorithms
• Programming with C++ concepts
• Solving path problems on the GPU
• Fractionation in planar kinematic chains: reconciling enumeration contradictions
• Treewidth computations. I: Upper bounds
• Scheduling arc maintenance jobs in a network to maximize total flow over time
• DMTL
• FC++
• GrAL
• LEDA
• JGraphT—A Java Library for Graph Data Structures and Algorithms
• MAPC
• MCF
• RelaxIV
• JGraphT
• Asymptote
• TSPASS
• POOMA
• BEHAVE
• Boost
• CodeBoost
• fireLib
• libstdc++
• Mayfly
• Treewidthlib
• 2D triangulations
• ComputeTW
• STL
• CS2
• MCFSimplex
• Traits
• The simplified partial digest problem: approximation and a graph-theoretic model
• TRP++
• VaqUoT
• VaqTree
• ESOLID
• MedOlDatschgerl
• Camlp4
• MatlabBGL
• libigl
• OpenModelica
• KronFit
• GGL
• SystemModeler
• gbeta
• MRST-co2lab
• GENREG
• Tecton
• GraphCanon
• PermGroup
• FlamMap
• IETL
• KappaTools
• A generic topology library
• GeomLib
• PlaGeo
• SpaGeo
• HexDom
• Hex2Spline
• HexGen
• HyperlogProcedures
• A new heuristic for detecting non-Hamiltonicity in cubic graphs
• Graph approach to quantum systems
• Evacuation dynamics influenced by spreading hazardous material
• Title not available (Why is that?)
• Capacity inverse minimum cost flow problem
• Complex-shaped beam element and graph-based optimization of compliant mechanisms
• Local stability implies global stability for the 2-dimensional Ricker map
• HyPAM: A hybrid continuum-particle model for incompressible free-surface flows
• Advanced programming techniques applied to CGAL's arrangement package
• An adaptable and extensible geometry kernel
• A flow based pruning scheme for enumerative equitable coloring algorithms
• The secret life of keys: on the calculation of mechanical lock systems
• A software package for chemically inspired graph transformation
• Multiresolution coupled vertical equilibrium model for fast flexible simulation of CO\(_2\) storage
• Bounds on maximum concurrent flow in random bipartite graphs
• The Nemhauser-Trotter reduction and lifted message passing for the weighted CSP
• Analytical and simulation-based design space exploration of software defined radios
• Selection of vine copulas
• Emergence of giant strongly connected components in continuum disk-spin percolation
• On the effectiveness of the genetic paradigm for polygonization
• Coin-flipping, Ball-dropping, and Grass-hopping for generating random graphs from matrices of edge probabilities
• Dynamic Matching Algorithms in Practice
• A divide and conquer matheuristic algorithm for the prize-collecting Steiner tree problem
• Rewriting theory for the life sciences: a unifying theory of CTMC semantics
• Solving Constraint-Satisfaction Problems with Distributed Neocortical-Like Neuronal Networks
• Subregion graph: a path planning acceleration structure for characters with various motion types in very large environments

This page was built for software: BGL