Results 71 to 72 of about 1,233 (72)
Some of the next articles are maybe not open access.
The bandwidth minimization problem for cyclic caterpillars with hair length 1 is NP-complete
Theoretical Computer Science, 2003exaly
The bandwidth minimization problem for cyclic caterpillars with hair length 1 is NP-complete
Theoretical Computer Science, 2003