- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISBN
-
9783540136415
354013641X
9780387136417
038713641X
- Dimensions
-
25 cm
- Extent
-
XII, 260 S.
- Language
-
Deutsch
- Notes
-
54 graph. Darst.
Teilausg. - Literaturverz. S. 252 - 258
- Bibliographic citation
-
Data structures and algorithms / Mehlhorn, Kurt ; 2
- Keyword
-
Graph
NP-vollständiges Problem
Graph
NP-vollständiges Problem
- Event
-
Veröffentlichung
- (where)
-
Berlin, Heidelberg, New York, Tokyo
- (who)
-
Springer
- (when)
-
1984
- Creator
- Contributor
-
Mehlhorn, Kurt
- 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:13 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
- Mehlhorn, Kurt
- Mehlhorn, Kurt
- Springer
Time of origin
- 1984
Other Objects (12)
Teaching NP completeness in secondary schools
NP-completeness notions under strong hypotheses
NP-completeness notions under strong hypotheses
Graph algorithms
Graphs, networks and algorithms
Graphs, networks and algorithms
Algorithms on trees and graphs
Dynamical systems, graphs, and algorithms
Dynamical systems, graphs, and algorithms
Group-theoretic algorithms and graph isomorphism
Randomness and completeness in computational complexity
Sparsity : graphs, structures, and algorithms
Teaching NP completeness in secondary schools
NP-completeness notions under strong hypotheses
NP-completeness notions under strong hypotheses
Graph algorithms
Graphs, networks and algorithms
Graphs, networks and algorithms
Algorithms on trees and graphs
Dynamical systems, graphs, and algorithms
Dynamical systems, graphs, and algorithms
Group-theoretic algorithms and graph isomorphism
Randomness and completeness in computational complexity
Sparsity : graphs, structures, and algorithms
Teaching NP completeness in secondary schools
NP-completeness notions under strong hypotheses
NP-completeness notions under strong hypotheses
Graph algorithms
Graphs, networks and algorithms
Graphs, networks and algorithms
Algorithms on trees and graphs
Dynamical systems, graphs, and algorithms
Dynamical systems, graphs, and algorithms
Group-theoretic algorithms and graph isomorphism
Randomness and completeness in computational complexity