New Applied Problems in the Theory of Acyclic Digraphs
The following two optimization problems on acyclic digraph analysis are solved. The first of them consists of determining the minimum (in terms of volume) set of arcs, the removal of which from an acyclic digraph breaks all <i>paths passing through</i> a subset of its vertices. The second problem is...
Sparad:
| Huvudupphov: | , |
|---|---|
| Materialtyp: | Artigo |
| Språk: | Inglês |
| Utgiven: |
MDPI AG
2021-12-01
|
| Serie: | Mathematics |
| Ämnen: | |
| Länkar: | https://www.mdpi.com/2227-7390/10/1/45 |
| Taggar: |
Inga taggar, Lägg till första taggen!
|