The following pages link to Nen-Fu Huang (Q209292):
Displaying 11 items.
- A divide-and-conquer algorithm for constructing relative neighborhood graph (Q911282) (← links)
- (Q916389) (redirect page) (← links)
- An optimal algorithm for constructing oriented Voronoi diagrams and geograph neighborhood graphs (Q916391) (← links)
- On the complexity of some arborescences finding problems on a multishop radio network (Q1123615) (← links)
- Complexity of the repeaters allocating problem (Q1183426) (← links)
- On the complexity of two circle connecting problems (Q1314320) (← links)
- A sweepline algorithm to solve the two-center problem (Q1318733) (← links)
- Intelligent handoff for mobile wireless internet (Q1859296) (← links)
- (Q4550355) (← links)
- On the complexity of two circle strongly connecting problems (Q5375363) (← links)
- The shortest path computation in MOSPF protocol using an annealed Hopfield neural network with a new cooling schedule (Q5946278) (← links)
