- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Dimensions
-
21 cm
- Extent
-
63 S.
- Language
-
Deutsch
- Notes
-
18 graph. Darst.
Literaturverz. S. 60 - 63
- Bibliographic citation
-
Preprint / Karl-Weierstraß-Institut für Mathematik ; 86,08
- Event
-
Veröffentlichung
- (where)
-
Berlin
- (who)
-
Karl-Weierstrass-Inst. für Mathematik
- (when)
-
1986
- Creator
- Table of contents
- Rights
-
Bei diesem Objekt liegt nur das Inhaltsverzeichnis digital vor. Der Zugriff darauf ist unbeschränkt möglich.
- Last update
-
11.03.2025, 12:24 PM CET
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
- Seese, Detlef
- Karl-Weierstrass-Inst. für Mathematik
Time of origin
- 1986
Other Objects (12)
The Steiner tree problem : a tour through graphs, algorithms, and complexity
Algorithms on trees and graphs
The complexity of embedding graphs into binary trees
Robust Multicovers: Algorithms and Complexity
Cycle bases of graphs and spanning trees with many leaves - complexity results on planar and regular graphs
Cycle bases of graphs and spanning trees with many leaves : complexity results on planar and regular graphs
Multivariate Algorithms and Information-Based Complexity
Network Visualization : Algorithms, Applications, and Complexity
Generalized Petri Nets: Algorithms and Complexity
Graphs, networks and algorithms
Graphs, networks and algorithms
Graph complexity measures and monotonicity
The Steiner tree problem : a tour through graphs, algorithms, and complexity
Algorithms on trees and graphs
The complexity of embedding graphs into binary trees
Robust Multicovers: Algorithms and Complexity
Cycle bases of graphs and spanning trees with many leaves - complexity results on planar and regular graphs
Cycle bases of graphs and spanning trees with many leaves : complexity results on planar and regular graphs
Multivariate Algorithms and Information-Based Complexity
Network Visualization : Algorithms, Applications, and Complexity
Generalized Petri Nets: Algorithms and Complexity
Graphs, networks and algorithms
Graphs, networks and algorithms
Graph complexity measures and monotonicity
The Steiner tree problem : a tour through graphs, algorithms, and complexity
Algorithms on trees and graphs
The complexity of embedding graphs into binary trees
Robust Multicovers: Algorithms and Complexity
Cycle bases of graphs and spanning trees with many leaves - complexity results on planar and regular graphs
Cycle bases of graphs and spanning trees with many leaves : complexity results on planar and regular graphs
Multivariate Algorithms and Information-Based Complexity
Network Visualization : Algorithms, Applications, and Complexity
Generalized Petri Nets: Algorithms and Complexity
Graphs, networks and algorithms
Graphs, networks and algorithms