@article{oai:muroran-it.repo.nii.ac.jp:00010262,
 author = {髙岡, 旭 and TAKAOKA, Asahi and TAYU, Satoshi and 田湯, 智 and UENO, Shuichi and 上野, 修一},
 issue = {4},
 journal = {IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS},
 month = {},
 note = {application/pdf, Ordered Binary Decision Diagrams (OBDDs for short) are popular dynamic data structures for Boolean functions. In some modern applications, we have to handle such huge graphs that the usual explicit representations by adjacency lists or adjacency matrices are infeasible. To deal with such huge graphs, OBDD-based graph representations and algorithms have been investigated. Although the size of OBDD representations may be large in general, it is known to be small for some special classes of graphs. In this paper, we show upper bounds and lower bounds of the size of OBDDs representing some intersection graphs such as bipartite permutation graphs, biconvex graphs, convex graphs, (2-directional) orthogonal ray graphs, and permutation graphs.},
 pages = {824--834},
 title = {OBDD Representation of Intersection Graphs},
 volume = {E98D},
 year = {2015},
 yomi = {タカオカ, アサヒ and タユ, サトシ and ウエノ, シュウイチ}
}