. . . "Second, we proposed an efficient algorithm with O(|P|2k) complexity for timeslot assignment problem in TDMA/CDMA ad hoc wireless networks, where P is a path and k is the number of slots in a TDMA frame." . .