The following pages link to Makoto Imase (Q918986):
Displaying 13 items.
- Design of a d-connected digraph with a minimum number of edges and a quasiminimal diameter (Q918987) (← links)
- Sufficient conditions for maximally connected dense graphs (Q1086585) (← links)
- Fault-tolerant routings in a \(\kappa\)-connected network (Q1109755) (← links)
- Worst-case performance of Rayward-Smith's Steiner tree heuristic (Q1114397) (← links)
- Global conditions in debugging distributed programs (Q1200136) (← links)
- Design of a \(d\)-connected digraph with a minimum number of edges and a quasiminimal diameter. II (Q1917254) (← links)
- (Q3046622) (← links)
- Connectivity of Regular Directed Graphs with Small Diameters (Q3216689) (← links)
- A Design for Directed Graphs with Minimum Diameter (Q3663185) (← links)
- (Q3827948) (← links)
- Design to Minimize Diameter on Building-Block Network (Q3905213) (← links)
- An Adaptive Capacity Allocation Scheme in Telephone Networks (Q3944300) (← links)
- Dynamic Steiner Tree Problem (Q3977293) (← links)
