The following pages link to Toshihide Ibaraki (Q171928):
Displaying 50 items.
- Sufficient Conditions for Graphs to Have Threshold Number 2 (Q3936783) (← links)
- Deadlock-Free Systems for a Bounded Number of Processes (Q3938474) (← links)
- An efficient algorithm for K shortest simple paths (Q3956415) (← links)
- Threshold Sequences (Q3964623) (← links)
- Maximum flows in probabilistic networks (Q3984285) (← links)
- Counting the number of minimum cuts in undirected multigraphs (Q3987534) (← links)
- Computing Edge-Connectivity in Multigraphs and Capacitated Graphs (Q3989010) (← links)
- (Q3993069) (← links)
- DUAL-BASED NEWTON METHODS FOR NONLINEAR MINIMUM COST NETWORK FLOW PROBLEMS (Q4006125) (← links)
- On Onaga's upper bound on the mean values of probabilistic maximum flows (Q4018972) (← links)
- Minimal representations of some classes of dynamic programming (Q4051891) (← links)
- Finite automata having cost functions (Q4103468) (← links)
- AN ASSIGNMENT PROBLEM ON A NETWORK (Q4110792) (← links)
- ALGORITHMS FOR QUADRATIC FRACTIONAL PROGRAMMING PROBLEMS (Q4120290) (← links)
- (Q4124605) (← links)
- The Power of Dominance Relations in Branch-and-Bound Algorithms (Q4133408) (← links)
- ON THE COMPUTATIONAL EFFICIENCY OF BRANCH-AND-BOUND ALGORITHMS (Q4139973) (← links)
- Computational Efficiency of Approximate Branch-and-Bound Algorithms (Q4146568) (← links)
- Branch-and-bound procedure and state—space representation of combinatorial optimization problems (Q4146584) (← links)
- A Solvable Case of the One-Machine Scheduling Problem with Ready and Due Times (Q4156114) (← links)
- THE MULTIPLE-CHOICE KNAPSACK PROBLEM (Q4158817) (← links)
- Fractional knapsack problems (Q4159177) (← links)
- Finite automata having cost functions: Nondeterministic models (Q4160419) (← links)
- A PRIMAL CUTTING PLANE ALGORITHM FOR INTEGER FRACTIONAL PROGRAMMING PROBLEMS (Q4191880) (← links)
- Theoretical comparisons of search strategies in branch-and-bound algorithms (Q4192964) (← links)
- Depth-m search in branch-and-bound algorithms (Q4192965) (← links)
- A Polynomial Time Algorithm for the Resource Allocation Problem with a Convex Objective Function (Q4194738) (← links)
- On sparse subgraphs preserving connectivity properties (Q4201383) (← links)
- A PRACTICAL APPROACH TO DECOMPOSABLE NONLINEAR PROGRAMMING PROBLEMS (Q4201654) (← links)
- Two Arc-Disjoint Paths in Eulerian Digraphs (Q4210224) (← links)
- (Q4218412) (← links)
- (Q4228455) (← links)
- Augmenting Edge-Connectivity over the Entire Range inÕ(nm) Time (Q4238530) (← links)
- (Q4247449) (← links)
- (Q4249522) (← links)
- (Q4249524) (← links)
- (Q4249525) (← links)
- (Q4250193) (← links)
- (Q4251064) (← links)
- (Q4253477) (← links)
- (Q4253478) (← links)
- (Q4263725) (← links)
- (Q4268432) (← links)
- Horn Extensions of a Partially Defined Boolean Function (Q4268864) (← links)
- A SUCCESSIVE OVER-RELAXATION METHOD FOR QUADRATIC PROGRAMMING PROBLEMS WITH INTERVAL CONSTRAINTS (Q4285701) (← links)
- (Q4286721) (← links)
- Polynomial-Time Recognition of 2-Monotonic Positive Boolean Functions Given by an Oracle (Q4337435) (← links)
- Complexity of the Minimum Base Game on Matroids (Q4339378) (← links)
- VEHICLE SCHEDULING ON A TREE TO MINIMIZE MAXIMUM LATENESS (Q4345053) (← links)
- (Q4350037) (← links)
