Efficiently scanning all spanning trees of an undirected graph.
スポンサーリンク
概要
著者
-
Tamura Akihisa
Department Of Computer Science And Information Mathematics The University Of Electro-communications
-
Shioura Akiyoshi
Department Of Information Sciences Tokyo Institute Of Technology
関連論文
- A Semidefinite Programming Relaxation for the Generalized Stable Set Problem(Discrete Mathematics and Its Applications)
- THE GENERALIZED STABLE SET PROBLEM FOR PERFECT BIDIRECTED GRAPHS
- EFFICIENTLY SCANNING ALL SPANNING TREES OF AN UNDIRECTED GRAPH
- Minimization of M-convex Function(Discrete Integrable System and Discrete Analysis)
- Efficiently scanning all spanning trees of an undirected graph.
- Matching with partially ordered contracts