The computational complexity of graph problems with succinct multigraph representation
Year of publication: |
1988
|
---|---|
Authors: | Karpiński, Marek ; Wagner, Klaus W. |
Published in: |
Zeitschrift für Operations-Research : ZOR ; mathematical methods of operations research. - Heidelberg : Physica-Verl., ISSN 0340-9422, ZDB-ID 246737-9. - Vol. 32.1988, 3/4, p. 201-211
|
Subject: | Mathematik | Graphentheorie | Graph theory | Mathematische Optimierung | Mathematical programming |
-
Mathematical models and routing algorithms for economical cutting tool paths
Makarovskikh, T. A., (2018)
-
Introduction to the theory of matroids
Randow, Rabe von, (1975)
-
Hein, Olaf, (1977)
- More ...
-
Approximation hardness of graphic TSP on cubic graphs
Karpiński, Marek, (2015)
-
Weighted boolean formula games
Mavronicolas, Marios, (2007)
- More ...