An Almost-Linear-Time Algorithm for Solving the Graph-Realization Problem (Graphs and Combinatorics III)

スポンサーリンク

概要

• 論文の詳細を見る
• 京都大学の論文

著者

• Fujishige Satoru

  Institute of Policy and Planning Sciences University of Tsukuba

• Fujishige Satoru

  Institute of Socio-Economic Planning, University of Tsukuba

関連論文

• THE MINIMUM-WEIGHT IDEAL PROBLEM FOR SIGNED POSETS
• A GREEDY ALGORITHM FOR MINIMIZING A SEPARABLE CONVEX FUNCTION OVER A FINITE JUMP SYSTEM
• An Almost-Linear-Time Algorithm for Solving the Graph-Realization Problem (Graphs and Combinatorics III)
• A DUAL ALGORITHM FOR FINDING THE MINIMUM-NORM POINT IN A POLYTOPE
• A DUAL ALGORITHM FOR FINDING A NEAREST PAIR OF POINTS IN TWO POLYTOPES
• AN EFFICIENT COST SCALING ALGORITHM FOR THE INDEPENDENT ASSIGNMENT PROBLEM

スポンサーリンク