Models of computation for graph theoretic problems
Year of publication: |
1983
|
---|---|
Authors: | Turán, György |
Publisher: |
Bonn : Inst., Univ. |
Subject: | Graphentheorie | Graph theory | Computerunterstützung | Computerized method | Mathematische Optimierung | Mathematical programming |
-
Computing the Grotendieck constant of some graph classes
Laurent, Monique, (2011)
-
A wide-ranging computational comparison of high-performance graph colouring algorithms
Lewis, R., (2012)
-
Computational and theoretical challenges for computing the minimum rank of a graph
Hicks, Illya V., (2022)
- More ...
-
On the performance of on-line algorithms for partition problems
Faigle, Ulrich, (1988)
-
The critical complexity of graph properties
Turán, György, (1983)
-
On the greedy algorithm for an edge-partitioning problem
Turán, György, (1983)
- More ...