The bandwidth minimization problem for cyclic caterpillars with hair length 1 is NP-complete
Theoretical Computer Science - Selected papers in honor of Lawrence Harper
Optimal vertex ranking of block graphs
Information and Computation
Hi-index | 0.05 |