The following pages link to Graphs, networks and algorithms. (Q455381):
Displaying 22 items.
- An algorithm for a decomposition of weighted digraphs: with applications to life cycle analysis in ecology (Q883806) (← links)
- Timeline-based planning over dense temporal domains (Q1989337) (← links)
- Codes for distributed storage from 3-regular graphs (Q2012057) (← links)
- Heuristics for the dynamic facility location problem with modular capacities (Q2029361) (← links)
- Evolutionary operators for the Hamiltonian completion problem (Q2156924) (← links)
- Finding socially best spanning treesî (Q2430005) (← links)
- Pickup and delivery problems with autonomous vehicles on rings (Q2670581) (← links)
- Roots of Bivariate Polynomial Systems via Determinantal Representations (Q2797076) (← links)
- Brownian motions on metric graphs (Q2872272) (← links)
- NP-Completeness in the gossip monoid (Q4576008) (← links)
- A first hitting time approach to finding effective spreaders in a network (Q4965258) (← links)
- (Q5071868) (← links)
- (Q5109886) (← links)
- Mixing time and eigenvalues of the abelian sandpile Markov chain (Q5243105) (← links)
- Randomized Shortest-Path Problems: Two Related Models (Q5323768) (← links)
- Review of Similarities between Adjacency Model and Relational Model (Q5357739) (← links)
- Matchmaking and Testing for Exponentiality in the M/G/∞ Queue (Q5391087) (← links)
- Robust Independence Systems (Q5892606) (← links)
- Overlaying a hypergraph with a graph with bounded maximum degree (Q5918772) (← links)
- Random subcomplexes of finite buildings, and fibering of commutator subgroups of right‐angled Coxeter groups (Q6096957) (← links)
- Cycle-based formulations in distance geometry (Q6114894) (← links)
- Solving the minimum-cost double Roman domination problem (Q6608515) (← links)
