- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource, 1 online resource.
- Sprache
-
Englisch
- Erschienen in
-
Upward Book Embeddability of st-Graphs: Complexity and Algorithms ; day:14 ; month:7 ; year:2023 ; pages:1-51
Algorithmica ; (14.7.2023), 1-51
- Urheber
-
Binucci, Carla
Lozzo, Giordano Da
Giacomo, Emilio Di
Didimo, Walter
Mchedlidze, Tamara
Patrignani, Maurizio
- Beteiligte Personen und Organisationen
-
SpringerLink (Online service)
- DOI
-
10.1007/s00453-023-01142-y
- URN
-
urn:nbn:de:101:1-2023101811031084208899
- Rechteinformation
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
14.08.2025, 10:57 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
- Binucci, Carla
- Lozzo, Giordano Da
- Giacomo, Emilio Di
- Didimo, Walter
- Mchedlidze, Tamara
- Patrignani, Maurizio
- SpringerLink (Online service)
Ähnliche Objekte (12)
Algorithms and Complexity on Indexing Founder Graphs
Tree partite graphs and the complexity of algorithms
On Upward-Planar L-Drawings of Graphs
On Upward-Planar L-Drawings of Graphs
The Steiner tree problem : a tour through graphs, algorithms, and complexity
Graph algorithms
Temporal Graph Algorithms
Complexity of Variational Quantum Algorithms
Packet Routing: Complexity and Algorithms
Robust Multicovers: Algorithms and Complexity
Grassroots growing upwards
Multivariate Algorithms and Information-Based Complexity
Algorithms and Complexity on Indexing Founder Graphs
Tree partite graphs and the complexity of algorithms
On Upward-Planar L-Drawings of Graphs
On Upward-Planar L-Drawings of Graphs
The Steiner tree problem : a tour through graphs, algorithms, and complexity
Graph algorithms
Temporal Graph Algorithms
Complexity of Variational Quantum Algorithms
Packet Routing: Complexity and Algorithms
Robust Multicovers: Algorithms and Complexity
Grassroots growing upwards
Multivariate Algorithms and Information-Based Complexity
Algorithms and Complexity on Indexing Founder Graphs
Tree partite graphs and the complexity of algorithms
On Upward-Planar L-Drawings of Graphs
On Upward-Planar L-Drawings of Graphs
The Steiner tree problem : a tour through graphs, algorithms, and complexity
Graph algorithms
Temporal Graph Algorithms
Complexity of Variational Quantum Algorithms
Packet Routing: Complexity and Algorithms
Robust Multicovers: Algorithms and Complexity
Grassroots growing upwards