Pureに変更を加えた場合、すぐここに表示されます。

Fingerprint Naoyuki Kamiyamaが取り組む研究トピックをご確認ください。これらのトピックラベルは、この人物の研究に基づいています。これらを共に使用することで、固有の認識が可能になります。

Mathematics

Matroid
Arc of a curve
Directed Graph
Evacuation
Matching Problem
Stable Matching
Polynomial time
Dynamic Networks
Approximation Algorithms
Dominating Set
Function Minimization
Path Length
Submodular Function
Disjoint
Polynomial-time Algorithm
Matroid Intersection
Vertex of a graph
Set Covering
Covering Graph
Graph in graph theory
Efficient Algorithms
Tie
Pareto
Simple Graph
Directed Acyclic Graph
Costs
Adjacency Matrix
Exact Algorithms
Reconfiguration
Covering
Condensation
Rigid Body
Packing
Necessary Conditions
Bipartite Graph
Sufficient Conditions
Extended Formulations
Minimization Problem
Game
Many to many
Robustness
Network Flow
Nucleolus
Precedence Constraints
Covering Problem
Japan
Denote
NP-complete problem
Approximability
Vertex Cover

Engineering & Materials Science

Polynomials
Directed graphs
Approximation algorithms
Computational complexity
Hinges
Costs
Condensation
Stabilization
Coloring
Hardness
Newton-Raphson method
Airports