- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1436-4646
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
online resource.
- Erschienen in
-
Sparse graphs and an augmentation problem ; day:21 ; month:7 ; year:2021 ; pages:1-30
Mathematical programming ; (21.7.2021), 1-30
- Urheber
-
Király, Csaba
Mihálykó, András
- Beteiligte Personen und Organisationen
-
SpringerLink (Online service)
- DOI
-
10.1007/s10107-021-01689-0
- URN
-
urn:nbn:de:101:1-2021102300515556524438
- Rechteinformation
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
15.08.2025, 07:19 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Király, Csaba
- Mihálykó, András
- SpringerLink (Online service)
Ähnliche Objekte (12)
Graph theory and sparse matrix computation
Random perturbation of sparse graphs
Linear Orderings of Sparse Graphs
Sparse discretization of sparse control problems
The bandwidth theorem in sparse graphs
Graph structure based data augmentation method
GraphZIP: a clique-based sparse graph compression method
Local Routing in Sparse and Lightweight Geometric Graphs
Constrained planarity and augmentation problems
Constrained planarity and augmentation problems
Sparse discretization of sparse control problems with measures
Threshold phenomena in branching trees and sparse random graphs
Graph theory and sparse matrix computation
Random perturbation of sparse graphs
Linear Orderings of Sparse Graphs
Sparse discretization of sparse control problems
The bandwidth theorem in sparse graphs
Graph structure based data augmentation method
GraphZIP: a clique-based sparse graph compression method
Local Routing in Sparse and Lightweight Geometric Graphs
Constrained planarity and augmentation problems
Constrained planarity and augmentation problems
Sparse discretization of sparse control problems with measures
Threshold phenomena in branching trees and sparse random graphs
Graph theory and sparse matrix computation
Random perturbation of sparse graphs
Linear Orderings of Sparse Graphs
Sparse discretization of sparse control problems
The bandwidth theorem in sparse graphs
Graph structure based data augmentation method
GraphZIP: a clique-based sparse graph compression method
Local Routing in Sparse and Lightweight Geometric Graphs
Constrained planarity and augmentation problems
Constrained planarity and augmentation problems
Sparse discretization of sparse control problems with measures