BGL
From MaRDI portal
Cited in
(only showing first 100 items - show all)- A new multi-resolution parallel framework for SPH
- Fair immunization and network topology of complex financial ecosystems
- Evacuation dynamics influenced by spreading hazardous material
- Efficient connection processing in equation-based object-oriented models
- A global optimization algorithm for solving the minimum multiple ratio spanning tree problem
- Compact sparse symbolic Jacobian computation in large systems of ODEs
- scientific article; zbMATH DE number 6776481 (Why is no real title available?)
- Complex-shaped beam element and graph-based optimization of compliant mechanisms
- Capacity inverse minimum cost flow problem
- Local stability implies global stability for the 2-dimensional Ricker map
- Optimal distributed linear averaging
- SPHGal
- Edge stability in secure graph domination
- HyPAM: A hybrid continuum-particle model for incompressible free-surface flows
- Single-source shortest paths with the parallel boost graph library
- Advanced programming techniques applied to CGAL's arrangement package
- A new dichotomic algorithm for the uniform random generation of words in regular languages
- A generic software design for Delaunay refinement meshing
- Extracting unsatisfiable cores for LTL via temporal resolution
- A language for generic programming in the large
- Multi-stage programming with functors and monads: eliminating abstraction overhead from generic code
- An adaptable and extensible geometry kernel
- A flow based pruning scheme for enumerative equitable coloring algorithms
- Enhancing unsatisfiable cores for LTL with information on temporal relevance
- The secret life of keys: on the calculation of mechanical lock systems
- Treewidth computations. II. Lower bounds
- An Evaluation of Automata Algorithms for String Analysis
- A software package for chemically inspired graph transformation
- Multiresolution coupled vertical equilibrium model for fast flexible simulation of CO\(_2\) storage
- Models for the single-vehicle preemptive pickup and delivery problem
- Minimum-cost flow algorithms: an experimental evaluation
- Bounds on maximum concurrent flow in random bipartite graphs
- Computing large matchings in planar graphs with fixed minimum degree
- The Nemhauser-Trotter reduction and lifted message passing for the weighted CSP
- Analytical and simulation-based design space exploration of software defined radios
- Concepts for High-Perfomance Scientific Computing
- Selection of vine copulas
- Properties of the DGS-auction algorithm
- Emergence of giant strongly connected components in continuum disk-spin percolation
- Modeling wildfire propagation with Delaunay triangulation and shortest path algorithms
- 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
- Programming with C++ concepts
- A divide and conquer matheuristic algorithm for the prize-collecting Steiner tree problem
- Solving path problems on the GPU
- Dynamic Matching Algorithms in Practice
- Fractionation in planar kinematic chains: reconciling enumeration contradictions
- DARN!
- DMTL
- FC++
- GrAL
- LEDA
- STAPL
- LOOK
- EXACUS
- Boost C++ Libraries
- PBGL
- MAPC
- MCF
- RelaxIV
- JGraphT
- Asymptote
- TSPASS
- POOMA
- BEHAVE
- Boost
- CodeBoost
- fireLib
- libstdc++
- Mayfly
- Treewidthlib
- 2D triangulations
- ComputeTW
- STL
- CS2
- MCFSimplex
- Traits
- TRP++
- VaqUoT
- VaqTree
- ESOLID
- MedOlDatschgerl
- Camlp4
- MatlabBGL
- libigl
- OpenModelica
- KronFit
- GGL
- SystemModeler
- gbeta
- MRST-co2lab
- GENREG
- Tecton
- GraphCanon
- PermGroup
- FlamMap
- IETL
- KappaTools
- GeomLib
- PlaGeo
This page was built for software: BGL
