- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1573-2886
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
online resource.
- Bibliographic citation
-
Computing directed Steiner path covers ; day:27 ; month:7 ; year:2021 ; pages:1-30
Journal of combinatorial optimization ; (27.7.2021), 1-30
- Creator
- Contributor
-
SpringerLink (Online service)
- DOI
-
10.1007/s10878-021-00781-7
- URN
-
urn:nbn:de:101:1-2021102423225689097962
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
15.08.2025, 7:24 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Gurski, Frank
- Komander, Dominique
- Rehs, Carolin
- Rethmann, Jochen
- Wanke, Egon
- SpringerLink (Online service)
Other Objects (12)
Target control of linear directed networks based on the path cover problem
The Steiner cycle and path cover problem on interval graphs
Directed path spaces via discrete vector fields
Comparing and Computing Parameters for Directed Graphs
Characterizations and Directed Path-Width of Sequence Digraphs
Computing Euclidean Steiner trees over segments
Computing Euclidean Steiner trees over segments
Computing shortest path distances based on cluster-pairs
Computing subset vertex covers in H-free graphs
A computing method for 3D magnetotelluric modelling directed by polynomials
Stationary distribution and cover time of sparse directed configuration models
First Betti number of the path homology of random directed graphs
Target control of linear directed networks based on the path cover problem
The Steiner cycle and path cover problem on interval graphs
Directed path spaces via discrete vector fields
Comparing and Computing Parameters for Directed Graphs
Characterizations and Directed Path-Width of Sequence Digraphs
Computing Euclidean Steiner trees over segments
Computing Euclidean Steiner trees over segments
Computing shortest path distances based on cluster-pairs
Computing subset vertex covers in H-free graphs
A computing method for 3D magnetotelluric modelling directed by polynomials
Stationary distribution and cover time of sparse directed configuration models
First Betti number of the path homology of random directed graphs
Target control of linear directed networks based on the path cover problem
The Steiner cycle and path cover problem on interval graphs
Directed path spaces via discrete vector fields
Comparing and Computing Parameters for Directed Graphs
Characterizations and Directed Path-Width of Sequence Digraphs
Computing Euclidean Steiner trees over segments
Computing Euclidean Steiner trees over segments
Computing shortest path distances based on cluster-pairs
Computing subset vertex covers in H-free graphs
A computing method for 3D magnetotelluric modelling directed by polynomials
Stationary distribution and cover time of sparse directed configuration models