BGL

swMATH17557MaRDI QIDQ29415FDOQ29415

Author name not available (Why is that?)

Cited In (57)

• Coin-Flipping, Ball-Dropping, and Grass-Hopping for Generating Random Graphs from Matrices of Edge Probabilities
• Emergence of giant strongly connected components in continuum disk-spin percolation
• 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
• 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
• An Evaluation of Automata Algorithms for String Analysis
• Treewidth computations. II. Lower bounds
• Multiresolution coupled vertical equilibrium model for fast flexible simulation of CO\(_2\) storage
• Minimum-cost flow algorithms: an experimental evaluation
• Models for the single-vehicle preemptive pickup and delivery problem
• 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
• Properties of the DGS-auction algorithm
• Motion planning via manifold samples
• Modeling wildfire propagation with Delaunay triangulation and shortest path algorithms
• On the effectiveness of the genetic paradigm for polygonization
• A Software Package for Chemically Inspired Graph Transformation
• Programming with C++ concepts
• Dynamic Matching Algorithms in Practice
• A divide and conquer matheuristic algorithm for the prize-collecting Steiner tree problem
• Solving path problems on the GPU
• Fractionation in planar kinematic chains: reconciling enumeration contradictions
• Selection of Vine Copulas
• Treewidth computations. I: Upper bounds
• Scheduling arc maintenance jobs in a network to maximize total flow over time
• JGraphT—A Java Library for Graph Data Structures and Algorithms
• Title not available (Why is that?)
• The simplified partial digest problem: approximation and a graph-theoretic model
• Rewriting theory for the life sciences: a unifying theory of CTMC semantics
• Title not available (Why is that?)
• Solving Constraint-Satisfaction Problems with Distributed Neocortical-Like Neuronal Networks
• A generic topology library
• A new heuristic for detecting non-Hamiltonicity in cubic graphs
• Graph approach to quantum systems
• Subregion graph: a path planning acceleration structure for characters with various motion types in very large environments
• 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
• Title not available (Why is that?)
• The Secret Life of Keys: On the Calculation of Mechanical Lock Systems
• Compact sparse symbolic Jacobian computation in large systems of ODEs
• 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
• Optimal distributed linear averaging
• HyPAM: A hybrid continuum-particle model for incompressible free-surface flows
• Advanced programming techniques applied to CGAL's arrangement package

This page was built for software: BGL