Login
|
New Account
AAAAAA
ITA
ENG
Results:
1-3
|
Results: 3
Maximum packing for k-connected partial k-trees in polynomial time
Authors:
Dessmark, A Lingas, A Proskurowski, A
Citation:
A. Dessmark et al., Maximum packing for k-connected partial k-trees in polynomial time, THEOR COMP, 236(1-2), 2000, pp. 179-191
Faster algorithms for subgraph isomorphism of k-connected partial k-trees
Authors:
Dessmark, A Lingas, A Proskurowski, A
Citation:
A. Dessmark et al., Faster algorithms for subgraph isomorphism of k-connected partial k-trees, ALGORITHMIC, 27(3-4), 2000, pp. 337-347
Memory requirements for table computations in partial k-tree algorithms
Authors:
Aspvall, B Proskurowski, A Telle, JA
Citation:
B. Aspvall et al., Memory requirements for table computations in partial k-tree algorithms, ALGORITHMIC, 27(3-4), 2000, pp. 382-394
Risultati:
1-3
|