Representation of Bipartite Graphs by OBDDs

スポンサーリンク

概要

論文の詳細を見る
We show upper and lower bounds for the worst-case OBDD size of certain bipartite graphs such as bipartite permutation graphs, biconvex graphs, convex graphs, 2-directional orthogonal ray graphs, and orthogonal ray graphs.
2012-09-27

著者

Satoshi Tayu
Department Of Communications And Integrated Systems Tokyo Institute Of Technology
Shuichi Ueno
Department of Communications and Integrated Systems, Tokyo Institute of Technology
Shuichi Ueno
Department Of Communications And Integrated Systems Tokyo Institute Of Technology
Asahi Takaoka
Department of Communications and Integrated Systems, Tokyo Institute of Technology
Asahi Takaoka
Department Of Communications And Integrated Systems Tokyo Institute Of Technology
Asahi Takaoka
Department of Communications and Computer Engineering, Tokyo Institute of Technology
Shuichi Ueno
Department of Communication and Computer Engineering, Tokyo Institute of Technology

関連論文

スポンサーリンク