The parallel complexity of the connected subgraph problem [C.T.I. Technical Reports TR. 90.10.23]
Main Authors: | Serna, Maria, 1959- (Author), Κυρούσης, Λευτέρης Μ. (Author), Σπυράκης, Παύλος Γ. (Author) |
---|---|
Format: | Book |
Language: | English |
Published: |
Πάτρα Ελλάδα
Ινστιτούτο Τεχνολογίας Υπολογιστών
1990
|
Subjects: |
Similar Items
-
The structure of sets in P C.T.I. Technical Report TR. 90.04.11
by: Serna, Maria, 1959-, et al.
Published: (1990) -
On the difficulty of Approximating Linear Programming C.T.I. Technical Report TR. 90.02.3
by: Serna, Maria, 1959-
Published: (1990) -
Tight RNC approximations to Max Flow [C.T.I. Technical Reports] TR. 90.01.1
by: Serna, Maria, 1959-, et al.
Published: (1990) -
Applying P-completeness to Approximation Problems [C.T.I. Technical Reports] TR. 90.05.14
by: Serna, Maria, 1959-, et al.
Published: (1990) -
Optimal parallel Algorithms for Sparce Graphs C.T.I. Technical Report TR.90.04.07
by: Ζαρολιάγκης, Χρήστος, et al.
Published: (1990)