Combinatorial optimization, Vol. C.. Disjoint paths, hypergraphs : chapters 70 - 83
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISBN
-
9783540443896
- Umfang
-
XXXIII S., S. 1222 - 1881
- Sprache
-
Englisch
- Anmerkungen
-
graph. Darst.
Literaturverz. S. 1463 - 1766
- Erschienen in
-
Combinatorial optimization
- Ereignis
-
Veröffentlichung
- (wo)
-
Berlin, Heidelberg, New York, Hong Kong, London, Milan, Paris, Tokyo
- (wer)
-
Springer
- (wann)
-
2003
- Urheber
- Inhaltsverzeichnis
- Rechteinformation
-
Bei diesem Objekt liegt nur das Inhaltsverzeichnis digital vor. Der Zugriff darauf ist unbeschränkt möglich.
- Letzte Aktualisierung
-
11.06.2025, 13:44 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
- Schrijver, Alexander
- Springer
Entstanden
- 2003
Ähnliche Objekte (12)
Fastest Paths, Almost Disjoint Paths, and Beyond
Shortest edge disjoint paths in graphs
Edge-Disjoint Paths in Eulerian Digraphs
Finding Disjoint Paths on Directed Acyclic Graphs
The Complexity of Packing Edge-Disjoint Paths
Partitioning Infinite Hypergraphs into Few Monochromatic Berge-Paths
Disjoint Paths, Dynamic Equilibria, and the Design of Networks
Computing vertex-disjoint paths in large graphs using MAOs
Improved Algorithms for the 2-Vertex Disjoint Paths Problem
On Structural Parameterizations of the Edge Disjoint Paths Problem
Ramsey Problems for Monotone Paths in Graphs and Hypergraphs
Edge-Disjoint Paths in Planar Graphs with Short Total Length
Fastest Paths, Almost Disjoint Paths, and Beyond
Shortest edge disjoint paths in graphs
Edge-Disjoint Paths in Eulerian Digraphs
Finding Disjoint Paths on Directed Acyclic Graphs
The Complexity of Packing Edge-Disjoint Paths
Partitioning Infinite Hypergraphs into Few Monochromatic Berge-Paths
Disjoint Paths, Dynamic Equilibria, and the Design of Networks
Computing vertex-disjoint paths in large graphs using MAOs
Improved Algorithms for the 2-Vertex Disjoint Paths Problem
On Structural Parameterizations of the Edge Disjoint Paths Problem
Ramsey Problems for Monotone Paths in Graphs and Hypergraphs
Edge-Disjoint Paths in Planar Graphs with Short Total Length
Fastest Paths, Almost Disjoint Paths, and Beyond
Shortest edge disjoint paths in graphs
Edge-Disjoint Paths in Eulerian Digraphs
Finding Disjoint Paths on Directed Acyclic Graphs
The Complexity of Packing Edge-Disjoint Paths
Partitioning Infinite Hypergraphs into Few Monochromatic Berge-Paths
Disjoint Paths, Dynamic Equilibria, and the Design of Networks
Computing vertex-disjoint paths in large graphs using MAOs
Improved Algorithms for the 2-Vertex Disjoint Paths Problem
On Structural Parameterizations of the Edge Disjoint Paths Problem
Ramsey Problems for Monotone Paths in Graphs and Hypergraphs