2019-09-18T10:03:16Zhttps://ir.soken.ac.jp/?action=repository_oaipmhoai:ir.soken.ac.jp:000008532018-10-26T05:14:17Z00002:00429:00019
Studies on Subgraph and Supergraph Enumeration AlgorithmsStudies on Subgraph and Supergraph Enumeration Algorithmsenghttp://id.nii.ac.jp/1013/00000853/Thesis or Dissertation清見, 礼キヨミ, マサシMasashi, KIYOMI総合研究大学院大学博士（情報学）総研大甲第998号2006-09-29 Enumeration is listing all objects that satisfy given properties. We call<br />enumeration of subgraphs of a given graph, such that those subgraphs have<br />specified properties, as subgraph enumeration. Similarly We call enumeration<br />of supergraphs of a given graph as subgraph enumeration. In this thesis, we will<br />consider about subgraph/supergraph enumeration algorithms. In areas such as<br />data mining or statistics, subgraph enumeration and supergraph enumeration<br />play important roles to find frequent patterns or to draw on some rules satisfied<br />by the inputs, etc.<br /> We developed two types of algorithms of subgraph/supergraph enumeration<br />for chordal and related graphs; one searches graphs to be enumerated by an<br />edge addition or an edge removal; the other defines a neighbor of searching by<br />a simplicial vertex elimination, which is specific for chordal graphs. The first<br />type uses the fact that there are only O(n<sup>2</sup>) edges in a complete graph K<sub>n</sub>,<br />and achieves polynomial time delay algorithms. We can use this method to<br />develop both subgraph enumeration algorithms and super graph enumeration<br />algorithms. The second type uses nice properties of simplicial vertices and the<br />fact that we can enumerate cliques in a chordal graph quickly. Using this type<br />of algorithm for chordal subgraph enumeration is faster than doing so using<br />the first type (it needs only constant time to enumerate each chordal graph).<br />However, this method is only for the subgraph enumeration.<br /> The organization of this thesis is as follows. We first introduce enumeration,<br />focusing particularly on graph enumeration. Chapter 2 provides the preliminaries,<br />notes about terms that we use in this thesis, and explanations about graph<br />classes. In Chapter 3, we discuss the difficulties of our enumeration problems,<br />and explain the framework of the reverse search method. In Chapter 4, we<br />develop algorithms for our enumeration problems. These algorithms are based<br />on the reverse search method. They are of two types: one defines parents such<br />that the difference between a graph and its parent is exactly one, and the other<br />defines parents such that the parent of a graph is obtained by eliminating a<br />simplicial vertex. And, we conclude the thesis in Chapter 5.application/pdfhttps://ir.soken.ac.jp/?action=repository_action_common_download&item_id=853&item_no=1&attribute_id=19&file_no=8CC BY-NC-NDhttps://ir.soken.ac.jp/?action=repository_action_common_download&item_id=853&item_no=1&attribute_id=19&file_no=9CC BY-NC-ND2010-02-22