6 citations · 12 across the 6 of their papers we have counts for
6 papers · 1 filter
O(1) Time Generation of Adjacent Multiset Combinations
Tadao Takaoka
We solve the problem of designing an O(1) time algorithm for generating adjacent multiset combinations in a different approach from Walsh. By the word adjacent, we mean that two ad…
Multi-level Loop-less Algorithm for Multi-set Permutations
Tadao Takaoka
We present an algorithm that generates multiset permutations in O(1) time for each permutation, that is, by a loop-less algorithm with O(n) extra memory requirement. There already…
Combining the Shortest Paths and the Bottleneck Paths Problems
Tong-Wook Shinn, Tadao Takaoka
We combine the well known Shortest Paths (SP) problem and the Bottleneck Paths (BP) problem to introduce a new problem called the Shortest Paths for All Flows (SP-AF) problem that…
Combining All Pairs Shortest Paths and All Pairs Bottleneck Paths Problems
Tong-Wook Shinn, Tadao Takaoka
We introduce a new problem that combines the well known All Pairs Shortest Paths (APSP) problem and the All Pairs Bottleneck Paths (APBP) problem to compute the shortest paths for…
Efficient Graph Algorithms for Network Analysis
Tong-Wook Shinn, Tadao Takaoka
The GC problem is to identify a pre-determined number of center vertices such that the distances or costs from (or to) the centers to (or from) other vertices is minimized. The bot…
Some Extensions of the All Pairs Bottleneck Paths Problem
Tong-Wook Shinn, Tadao Takaoka
We extend the well known bottleneck paths problem in two directions for directed unweighted (unit edge cost) graphs with positive real edge capacities. Firstly we narrow the proble…