Searching for authors named "Akihisa Tamura" – sorted by Relevance.
-
The Linear Complementarity Problem on Oriented Matroids
- on Algorithm Engineering: Surveys The Linear Complementarity Problem on Oriented Matroids # Akihisa TAMURA
- Add To MetaCart
-
Efficiently Scanning All Spanning Trees of an Undirected Graph
- of Information Sciences Tokyo Institute of Technology 2-12-1 Oh-okayama, Meguro-ku Tokyo 152, Japan Akihisa
- Cited by 8 (1 self) – Add To MetaCart
-
A revision of Minty's algorithm for finding a maximum weight stable set of a claw-free graph
- Daishin Nakamurayand Akihisa Tamuraz y Department of Computer Sciences, University of Electro
- Cited by 7 (0 self) – Add To MetaCart
-
A Semidefinite Programming Relaxation for the Generalized Stable Set Problem
- for the Generalized Stable Set Problem 3 Tetsuya Fujie and Akihisa Tamura September, 2000 Abstract In this paper
- Cited by 1 (1 self) – Add To MetaCart
-
New Characterizations of M-convex Functions and Connections to Mathematical Economics
- and Connections to Mathematical Economics y Kazuo Murota and Akihisa Tamura December 12, 2000 Abstract
- Cited by 1 (1 self) – Add To MetaCart
-
Proximity Theorems of Discrete Convex Functions
- Add To MetaCart
-
On Circuit Valuation of Matroids
- Murota and Akihisa Tamura February 14, 2000 Abstract The concept of valuated matroids was introduced
- Add To MetaCart
-
An Optimal Algorithm for Scanning All Spanning Trees of Undirected Graphs
- Akihisa TAMURA y and Takeaki UNO z (July, 1994) Abstract: Let G be an undirected graph with V vertices
- Cited by 17 (2 self) – Add To MetaCart
-
Mathematical Engineering
- , Kazuo MUROTA, and Akihisa TAMURA METR 2004–09 February 2004 DEPARTMENT OF MATHEMATICAL INFORMATICS
- Add To MetaCart

