Maximal Prime Subgraph Decomposition of Bayesian Networks: A Relational Database Perspective
|
|
- Theodore Rose
- 6 years ago
- Views:
Transcription
1 Maximal Prime ubgraph ecomposition of ayesian Networks: Relational atabase Perspective an Wu chool of omputer cience University of Windsor Windsor Ontario anada N9 3P4 Michael Wong epartment of omputer cience University of Regina Regina askatchewan anada 4 02 bstract maximal prime subgraph decomposition junction tree (MP-J) is a useful computational structure that facilitates lazy propagation in ayesian networks (Ns). graphical method was proposed to construct an MP-J from a N. In this paper, we present a new method from a relational database (R) perspective which sheds light on the semantic meaning of the previously proposed graphical algorithm. 1. Introduction ayesian networks have been widely used for reasoning with uncertainty (Pearl 1988). Normally, a ayesian network is transformed into a junction tree on which probabilistic reasoning is conducted (auritzen & piegelhalter 1988; Huang & arwiche 1996). Various attempts have been made to improve the efficiency of probabilistic reasoning, for instance, the lazy propagation method (Madsen & Jensen 1998). Very recently, it was proposed to transform a ayesian network not into a junction tree, but into a maximal prime subgraph decomposition junction tree (MP-J) on which the lazy propagation can be greatly facilitated. graphical algorithm has been developed to construct the MP- J (Olesen & Madsen 2002). On the other hand, it has long been noted that there exists an intriguing relationship between Ns and Rs (Wen 1991) such that many problems in Ns can be considered as similar problems in Rs (Wong, Wu, & utz 2002; Wong & utz 2001). In this paper, we suggest a new algorithm for constructing an MP-J from a R perspective after carefully examining the graphical algorithm in (Olesen & Madsen 2002). y investigating the conditional independencies (Is) encoded in an MP-J, we show that constructing an MP-J from a N is equivalent to obtaining a conflict free set of Is encoded in the N. his new perspective makes it possible to apply a well-developed algorithm for constructing an acyclic database scheme in Rs to constructing an MP-J in Ns. his new method sheds light on the semantic meaning of the graphical method in (Olesen opyright c 2005, merican ssociation for rtificial Intelligence ( ll rights reserved. & Madsen 2002) and further confirms the strong relationship between Ns and Rs. he paper is organized as follows. In ection 2, we review pertinent background. In ection 3, we discuss the relationship between Ns and Rs which serves as the basis for the new proposed algorithm. In ection 4, we present the proposed new method and discuss its complexity. We conclude the paper in ection ackground ayesian Networks ayesian network (N) defined over a set V = { i i = 1,..., n} of finite discrete variables is a directed acyclic graph (G) denoted, augmented with a set of conditional probability distributions (Ps). ach vertex in corresponds one-to-one to a variable in V (we thus use the terms vertex, node, and variable interchangeably). he parents of a node i in is denoted π i. ach variable i V is associated with a P p( i π i ) such that the joint probability distribution (JP) p(v ) = p( i V i π i ). he G of a N encodes Is satisfied by the JP p(v ). We use the notation Y Z, where, Y, and Z are disjoint subsets of V, to denote that given Y, and Z are conditionally independent (Pearl 1988). I is full if Y Z = V (by Y Z, we mean Y Z), otherwise, it is embedded. Junction rees he G of a N is normally transformed into a junction tree for probabilistic reasoning. he transformation consists of two graphical operations, namely, moralization and triangulation (auritzen & piegelhalter 1988). he moralized graph of a G, denoted M, is an undirected graph obtained by connecting every pair of nodes with a common child which are not already connected in and then dropping the directionality of all directed edges. M is then triangulated by adding a chord, called fill-in edge, to every cycle whose length is greater than three. triangulation is minimal if removal of any fill-in edge will result in an untriangulated graph. he resulting triangulated graph is denoted. junction tree, written as, is constructed by identifying all the cliques (i.e., maximal complete subgraphs) of and arranging them as nodes of a tree to sat-
2 (i) ( ii) igure 1: (i) he G of the sia N. (ii) he moralized graph M of the G. (iii) he triangulated graph of the G. (iv) he junction tree constructed from. isfy the running intersection property (auritzen & piegelhalter 1988), which requires that every clique on the path between two cliques and in contains. Note that multiple junction trees may be produced from on the arrangements of the cliques, satisfying the running intersection property. If cliques and are connected by an edge in, this edge is labelled with. he set = { there is an edge between and } is called the separator set of, each element in is called a separator of. xample 1 onsider the sia N (auritzen & piegelhalter 1988) whose G is in ig. 1 (i). Its moralized graph M and triangulated graph are shown in ig. 1 (ii) and (iii), respectively. he dotted edges (, ) 1 and (, ) in M in ig. 1 (ii) were added during moralization. he fill-in edge (, ), dotted in ig. 1 (iii), was added during triangulation. here are 6 cliques in the triangulated graph and they have been arranged as a junction tree in ig. 1 (iv). Note that in ig. 1 (iv), the oval represents a clique identified from, the square box represents a separator in. MP Junction rees Very recently, it was suggested to transform a N not into a junction tree, but into an MP-J to facilitate lazy propagation (Olesen & Madsen 2002). efore we introduce MP- J, the following pertinent graph terminologies are needed. We use G(V ) (or G) to denote an undirected graph consisting of a finite set V of vertices. efinition 1 et the triplet (V 1,, V 2 ) denote a partition of V where V 1 V 2 = V. If every path in G(V ) between i V 1 and j V 2 contains a vertex in, then is a separator of G(V ) with respect to (V 1,, V 2 ). urthermore, if the subgraph induced by the separator, i.e., G(), is complete, then is a complete separator of G(V ) with respect to (V 1,, V 2 ). efinition 2 partition (V 1,, V 2 ) is a decomposition of a graph G(V ) if is a complete separator. he complete separator is further called a minimal complete separator if for any, (V 1,, V 2 ( )) is not a decomposition anymore. ( iii) 1 We use ( i, j) to denote a directed edge in a G. (iv) Note that each separator in (i.e., the separator set of junction tree ) is a minimal complete separator of the triangulated graph from which the junction tree is constructed. efinition 3 n undirected graph is a prime graph if it has no complete separator. If G is a subgraph of G and G is also a prime graph, then G is a prime subgraph of G. G(V ) is a maximal prime subgraph (mp-subgraph) of G(V ) if G(V ) is a prime subgraph of G(V ) and for any other subgraph G(V ) of G(V ), where V V, G(V ) is not a prime subgraph. efinition 4 (Olesen & Madsen 2002) et G be an undirected graph, its mp- subgraph decomposition (MP) is the set of induced mp-subgraphs of G. MP junction tree (MP-J) of G is a junction tree whose nodes are the mpsubgraphs of G. efinition 5 onsider a N with its G, its MP is the set of induced mp-subgraphs of the moralized graph M (Olesen & Madsen 2002). MP-J of the N is a junction tree whose nodes are the mp-subgraphs of M. ( i) (ii) igure 2: (i) he moralized graph M of the sia N in ig. 1. (ii) he induced mp-subgraphs of M. (iii) he MP-J of the sia N. xample 2 onsider the moralized graph M of the sia N in ig. 2 (i). M induces 5 mp-subgraphs as shown in ig. 2 (ii). n MP-J of the sia N can be constructed by arranging these 5 mp-subgraphs to satisfy the running intersection property as shown in ig. 2 (iii). Junction rees and Hypertrees he notion of junction tree has a close tie with the notion of hypertree which is widely used in Rs (Maier 1983). efinition 6 hypergraph is a pair (N, H), where N is a finite set of vertices and H is a set of hyperedges which are arbitrary subsets of N (hafer 1991), that is, H = {h 1,..., h n h i N }. We usually use H to denote the hypergraph (N, H). efinition 7 We say that a hyperedge h i in a hypergraph H is a twig if there exists another hyperedge h j in H, distinct from h i, such that ( h H {h i } h) h i = h i h j. We call any such h j a branch for the twig h i. he notions of twig and branch capture the scenario that the intersection of a hyperedge, namely, the twig, with the rest of the hypergraph is contained by a single hyperedge, namely, the branch. (iii)
3 efinition 8 hypergraph H is a hypertree (hafer 1991) or acyclic if its hyperedges can be ordered, say h 1, h 2,..., h n, such that h i is a twig in {h 1, h 2,..., h i }, for i = 2,..., n. We call any such ordering a tree (hypertree) construction ordering for H. efinition 9 Given a tree construction ordering h 1, h 2,..., h n, we can choose, for i from 2 to n, an integer j(i) such that 1 j(i) i 1 and h j(i) is a branch for h i in {h 1, h 2,..., h i }. We call a function j(i) that satisfies this condition a branching function for H and the tree construction ordering h 1, h 2,..., h n. Note that for a given hypertree, there might exist multiple tree construction orderings; for a given tree construction ordering, there might exist multiple choices of branching functions (hafer 1991). Given a tree construction ordering h 1, h 2,..., h n for a hypertree H and a branching function j(i) for this ordering, we can construct a set denoted H whose elements are the intersections of the twigs and their respective branches, i.e., H = {h j(2) h 2, h j(3) h 3,..., h j(n) h n }. Note that H is the same for any tree construction ordering of a given hypertree (hafer 1991) and we call H the separator set of H. Note also that for any hypertree H, there is a unique corresponding triangulated undirected graph denoted G H which has the same nodes as H and whose edges are constructed by connecting every two nodes that belongs to the same hyperedge of H. On the other hand, for any triangulated graph G, its cliques, being considered as hyperedges, constitute a unique hypertree denoted H G (Maier 1983). In other words, there is a one-to-one correspondence between triangulated undirected graphs and hypertrees. ince a hypertree corresponds to a triangulated undirected graph and a triangulated undirected graph may produce multiple junction trees, it is not surprising that given a hypertree, there exists a set of junction trees each of which corresponds to a particular tree construction ordering and a branching function (hafer 1991). his property implies that hypertrees are more versatile than junction trees. It is also trivial to see that given a junction tree, there always exists a unique corresponding hypertree representation denoted H whose hyperedges are the cliques in the junction tree. herefore, we will treat a junction tree as if it is a hypertree H whenever appropriate. urthermore, the separator set H of the hypertree H is exactly the same as the separator set of the junction tree, and both separator sets correspond exactly to the minimal complete separators of the triangulated graph G H. herefore, a junction tree in essence is a hypertree (with a particular tree constructing ordering and branching function) and the problem of constructing junction trees can be considered as a more general problem of constructing hypertrees. xample 3 onsider the hypertree H in igure 3 (i). It can be easily verified that the tree construction ordering, h 1 =, h 2 =, h 3 =, h 4 = H, h 5 =, h 6 = G, together with the branching function j(2) = 1, j(3) = 2, j(4) = 2, j(5) = 3, j(6) = 3, defines the junction tree in igure 3 (ii). he same ordering with a different branching function, namely, j(2) = 1, j(3) = H (i) G H (ii) G igure 3: (i) he hypertree H. (ii), (iii), (iv) hree possible junction tree representations of H in (i), respectively. 2, j(4) = 3, j(5) = 3, j(6) = 3, defines a different junction tree in igure 3 (iii). onsider a different tree construction ordering, i.e., h 1 =, h 2 =, h 3 =, h 4 =, h 5 = G, h 6 = H, together with the branching function j(2) = 1, j(3) = 2, j(4) = 3, j(5) = 3, j(6) = 5, it defines the junction tree in igure 3 (iv). It can also be easily verified that the separator sets of those junction trees in igure 3 (ii), (iii), and (iv) are not only the same, but also identical to the separator set of the hypertree H in igure 3 (i). 3. Ns and Rs It has been noticed that there exists a strong relationship between Ns and Rs. here are two previously obtained results that contribute to the new proposed algorithm. (1) he relationship between full Is and MVs. (2) onstructing an acyclic database scheme. et R be a finite set of symbols, called attributes. We define a database scheme R = {R 1, R 2,..., R n } to be a set of subsets of R, where R = R 1... R n. ach R i in R is a relation scheme. relation defined over a scheme R i is denoted r[r i ]. database scheme R can be treated as if it is a hypergraph each of whose hyperedges is one of the relation schemes in R. On the other hand, for a hypergraph, we can treat each of its hyperedge as a relation scheme and all its hyperedges constitute a database scheme. database scheme R is acyclic if its corresponding hypergraph is acyclic (Maier 1983). Multivalued ependence (MV) is an important class of data dependence that has been intensively studied in Rs. efinition 10 relation r[r] is said to satisfy the (full) multivalued dependency (MV) (Maier 1983), denoted, Y Z, if r[r] = r[y ] r[y Z], where denotes the natural join operator in relational algebra, R = Y Z, r[y ] and r[y Z] are projections (Maier 1983) of r[r] onto schemes Y and Y Z, respectively. Y is called the key of this MV. efinition 11 Given a set M of MVs, the left hand sides of the MVs in M are the keys of M. MV Y Z is said to split a set W of attributes if W and W Z. efinition 12 set M of (full) MVs defined over a set R of attributes is conflict free (Maier 1983) if (i) the keys of M are not split by any MV in M, and (ii) M satisfies H (ii) G H (iv) G
4 the intersection property (Maier 1983), that is, if ZY W and ZW Y are in M, then Z Y W M, where Y ZW = R. Recently, a thorough study (Wong, utz, & Wu 2000) has revealed that MVs and full Is, even though in different domains, correspond exactly to each other such that their implication problems coincide. his coincidence implies that the notions of keys and split can be carried over to full Is so that we can define conflict free for full Is in the exact same fashion as we did for MVs. efinition 13 (Wong, utz, & Wu 2000) set of full Is defined over a set V of variables is conflict free if (i) the keys of are not split by any I in, and (ii) satisfies the intersection property, that is, if ZY W and ZW Y are in, then Z Y W, where Y ZW = V. he significance of conflict free MVs is that they can be used to construct an acyclic database scheme (a hypertree) (Maier 1983). n efficient algorithm (ien 1982), referred to as ien-lgorithm-mvs in this paper, has been developed to construct a unique hypertree H from a set of conflict free MVs. 4. he New Relational atabase Method In this section, we will present a new method for constructing the MP-J of a N motivated by the I information encoded in the MP-J. We first briefly review the existing graphical algorithm in (Olesen & Madsen 2002), referred to as Olesen-Madsen-MP-J, using an example. he observations revealed by the examination motivate the development of the new method. he Olesen-Madsen-MP-J algorithm takes a G as input, moralizes and triangulates it. he algorithm then removes any redundant fill-in edges so that a minimal triangulation is obtained and a normal junction tree is constructed. fter that, it checks each separator of the resulting junction tree to decide whether it needs to aggregate the incidental cliques connected by the separator. onsider the sia N in xample 1. fter constructing the junction tree, the algorithm picks a junction tree separator and tests whether induces a complete subgraph of M (i.e., test whether M () is a complete subgraph of M ). If M () is not a complete subgraph, then the incidental cliques of, say, and in the junction tree, will be aggregated to obtain a bigger node which is the union of and. or instance, when testing the separator in igure 1 (iv), it can be verified that the subgraph induced by nodes and is not a complete subgraph of M because and are not connected in the moralized graph M as shown in igure 1 (ii). ince is connecting cliques and, they have to be aggregated to obtain a bigger node, i.e,, to replace the cliques, and the separator, which results in igure 2 (iii). he new structure in igure 2 (iii) is still a junction tree though. It is important to note that after the cliques and have been aggregated, the separator has been eliminated. his process repeats until all the separators in have been examined. It can be easily verified that all the other separators in the separator set induce complete subgraphs so that there are no more aggregations. herefore, the final resulting MP-J after all necessary aggregations, shown in igure 2 (iii), keeps only those separators originally in which induce complete subgraphs of M. It is well known that for any junction tree, each of its separators induces a full I satisfied by the JP defined by the N (Pearl 1988). More specifically, consider a junction tree consisting of cliques i, i = 1,..., k, with its separator set. If we delete a separator and its incidental edges from, will be separated into two disconnected parts. Without loss of generality, assuming one part contains 1,..., m, the other part contains the rest, the I induced by is m i=1 i k j=m+1 j. lso note that each induced I corresponds to a decomposition ( m i=1 k i,, j=m+1 j ) of the triangulated graph from which the junction tree is constructed, with being a minimal complete separator. xample 4 onsider the MP-J shown in ig. 2 (iii) consisting of cliques 1 =, 2 =, 3 =, 4 =, and 5 =, with its separator set = {,,, }. he I induced by the separator is , or. imilarly, the Is induced by the separators, and, are and,, and, respectively. Recall the ien-lgorithm-mvs algorithm which constructs an acyclic database scheme from a conflict free set of MVs, because of the correspondence between full Is and MVs, this algorithm has been carried over to the domain of Ns. In (Wong & utz 2001), an algorithm referred to as ien-lgorithm-is in this paper, was designed to construct a unique hypertree H from a set of conflict free full Is 2. Recall the fact that a junction tree has a corresponding hypertree and a junction tree can be derived from a hypertree, this turns the problem of constructing an MP-J into the problem of constructing a hypertree from which this MP- J can be derived. urthermore, the problem of constructing a hypertree, according to the algorithm ien-lgorithm-is, can be turned into the problem of obtaining a conflict free set of full Is. We therefore propose an alternative algorithm for constructing MP-J. We put our focus on how to obtain a set of conflict free full Is that can be used to construct the hypertree that corresponds to an MP-J. In xample 4, we demonstrated how to obtain a set of full Is from a junction tree. It was shown that the full Is identified as in xample 4 are conflict free and they are responsible for constructing the hypertree that corresponds to the junction tree from which this set of full Is is identified. In the context of MP-Js, if we can obtain a set of conflict free full Is from an MP-J without actually constructing it in the first place, then we can use 2 ee reference (Wong & utz 2001) for detailed discussions on ien-lgorithm-is and examples.
5 this set as input to the algorithm ien-lgorithm-is to construct a hypertree that corresponds to the MP-J we want to construct. he following theorem guarantees that such a conflict free set of Is is obtainable. onsider a G and its MP-J, let denote the set of conflict free full Is induced by separators in. heorem 1 Y Z if and only if (, Y, Z) is a decomposition of M with Y being the minimal complete separator. Proof 1 ( ) If Y Z, then Y is a minimal complete separator of the triangulated graph G (from which is constructed) and (, Y, Z) is a decomposition of G. If (, Y, Z) is a decomposition of G, then it implies that for every path in G from i to j Z, this path must pass through at least one vertex in Y. However, since every path from i to j in the moralized graph M is also a path in G, hence every path in M from to Z passes through Y, therefore (, Y, Z) is a decomposition of M with Y being the minimal complete separator. ( ) In (Wong, Wu, & utz 2002), it was proved that the decomposition (, Y, Z) of M with Y being a minimal complete separator is also a decomposition in every triangulated graph of M. herefore, Y is a junction tree separator in any junction tree that may be produced from M, including the MP-J. ince the algorithm Olesen-Madsen- MP-J only eliminates junction tree separators which do not induce complete subgraphs in M, the decomposition (, Y, Z) will be kept in the final resulting MP-J. herefore, Y Z. heorem 1 implies that the set of conflict free full Is encoded in an MP-J can be obtained in advance from the moralized graph of the original given G without constructing the MP-J. More precisely, the set can be obtained by examining every decomposition (, Y, Z) of the moralized graph such that Y is a minimal complete separator. fter the set is obtained, we can then use it as input to the algorithm ien-lgorithm-is to construct a hypertree and afterwards the MP-J. his analysis naturally results in the following algorithm for constructing an MP-J. lgorithm Relational-MP-J Input: a ayesian network with its G ; Output: an MP-J of. tep 1. Moralize the G to obtain M. tep 2. Identify each decomposition (, Y, Z) of M where Y is a minimal complete separator of M, and put the I Y Z in a set. tep 3. Invoke the ien-lgorithm-is with as input to obtain a hypertree H. tep 4. Return a junction tree constructed from G H. hronologically, prior to the algorithm Olesen-Madsen- MP-J, there existed another graphical algorithm (emer 1993), referred to as Graphical-MP, which can find all the mp-subgraphs of an arbitrary undirected graph (without going through the auxiliary junction tree as Olesen-Madsen- MP-J did). he Graphical-MP algorithm was designed as a pure graphical procedure which has applications in some graph problems and has the time complexity of O(ne), where n is the number of vertices and e is the number of edges in the undirected graph. he Olesen-Madsen-MP-J algorithm constructs the MP-J in the context of Ns via a junction tree obtained by minimal triangulation. his algorithm is also a graphical algorithm and specifically designed for Ns. he worst case complexity of this algorithm is dominated by triangulating the moralized graph which has the time complexity O(ne) while the time complexity of all other steps are no worse than this (Olesen & Madsen 2002). In other words, the algorithm Olesen-Madsen-MP-J does not exhibit any improvement over the algorithm Graphical-MP, as far as the complexity is concerned. Nevertheless, it provides a different graphical perspective for constructing an MP-J in the domain of Ns, namely, making full use of the intermediate junction tree obtained instead of directly working on the underlying moralized graph. onsider the new algorithm Relational-MP-J, the complexity of moralizing the input G to obtain M in step 1 is O(n 2 ) (Olesen & Madsen 2002). he complexity of identifying minimal complete separator decompositions in M to form in step 2 is O(ne) (emer 1993). onstructing the hypertree H from in step 3 takes O( n). inally, constructing the MP-J from H in step 4 takes O(n 2 ) to finish (Olesen & Madsen 2002). gain, the time complexity of the whole algorithm is dominated by step 2, i.e., O(ne). In other words, it has the same worst case time complexity with the Graphical-MP and Olesen-Madsen- MP-J algorithms. However, we want to emphasize that the new proposed algorithm makes the following two contributions: (1) It provides a semantic explanation for the graphical construction of the MP-J in (emer 1993; Olesen & Madsen 2002) based on the information encoded in an MP-J. hat is, constructing an MP-J is equivalent to obtaining a set of conflict full Is from the moralized graph of a given G. (2) ince the notion of conflict free Is is inherited and adapted from the notion of conflict free MVs in Rs, the new proposed algorithm makes full use of the existing algorithm ien-lgorithm-is, which was inherited from the database algorithm ien-lgorithm-mvs, to construct an MP-J. In other words, the core construction step of the algorithm Relational-MP-J is an application of the result on constructing a hypertree in database theory being applied in the N domain. his revelation farther confirms the intriguing relationship between Ns and Rs. 5. iscussion he bottleneck of the algorithm Olesen-Madsen-MP-J lies in the triangulation step whose complexity dominates the whole algorithm. ven though the new proposed algorithm does not need triangulation step, it needs to identify all the decompositions with minimal complete separators. It is perhaps worth pursuing how to shift the bottleneck of triangulation to decomposition identification which may result in a more efficient (perhaps approximate) algorithm.
6 lthough the new proposed algorithm is within the context of Ns, the idea of identifying and obtaining a conflict free set of full Is from the moralized graph of a G can also be applied to an arbitrary undirected graph, not necessarily a moralized graph of a G. herefore, the proposed method for constructing an MP-J is not confined to the domain of Ns. he relationship betwen conflict free MVs (Is) and hypertrees suggests that any graphical problem of constructing a hypertree can be equivalently considered as the problem of how to obtain a set of conflict free set of MVs (Is). his provides a new (algebraic) perspective for solving the graphical problem of constructing hypertrees (junction trees) in future research. or instance, the proposed algorithm may be possibly applied to obtain a hierarchical Markov network representation of a N (Wong, utz, & Wu 2001). I ransactions on Knowledge and ata ngineering 13(3): Wong,.; utz,.; and Wu, On the implication problem for probabilistic conditional independency. I ransactions on ystem, Man, ybernetics, Part : ystems and Humans 30(6): Wong,.; utz,.; and Wu, On undirected representations of bayesian networks. In M IG/IR Workshop on Mathematical/ormal Models in Information Retrieval (M/IR), Wong,.; Wu,.; and utz, riangulation of bayesian networks: a relational database perspective. In he hird International onference on Rough ets and urrent rends in omputing (R 2002), NI 2475, cknowledgment he authors wish to thank the referees for their helpful and constructive criticism. References Huang,., and arwiche, Inference in belief networks: procedural guide. International Journal of pproximate Reasoning 15(3): auritzen,., and piegelhalter, ocal computation with probabilities on graphical structures and their application to expert systems. Journal of the Royal tatistical ociety 50: emer, H Optimal decomposition by clique separators. iscrete Mathematics 113: ien, Y On the equivalence of database models. Journal of the M 29(2): Madsen,.., and Jensen,. V azy propagation in junction trees. In ooper, G.., and Moral,., eds., Proceedings of the 14th onference on Uncertainty in rtificial Intelligence (UI-98), an rancisco: Morgan Kaufmann. Maier, he heory of Relational atabases. Rockville, Maryland: omputer cience Press. Olesen, K., and Madsen, Maximal prime subgraph decomposition of bayesian networks. I ransactions on ystems, Man and ybernetics, Part : ybernetics 32(1): Pearl, J Probabilistic Reasoning in Intelligent ystems: Networks of Plausible Inference. an rancisco, alifornia: Morgan Kaufmann Publishers. hafer, G n axiomatic study of computation in hypertrees. chool of usiness Working Papers 232, University of Kansas. Wen, W rom relational databases to belief networks. In eventh onference on Uncertainty in rtificial Intelligence, Morgan Kaufmann Publishers. Wong,., and utz, onstructing the dependency structure of a multi-agent probabilistic network.
On the Implication Problem for Probabilistic Conditional Independency
IEEE TRANSACTIONS ON SYSTEMS, MAN, AND CYBERNETICS PART A: SYSTEMS AND HUMANS, VOL. 30, NO. 6, NOVEMBER 2000 785 On the Implication Problem for Probabilistic Conditional Independency S. K. M. Wong, C.
More informationThese notes present some properties of chordal graphs, a set of undirected graphs that are important for undirected graphical models.
Undirected Graphical Models: Chordal Graphs, Decomposable Graphs, Junction Trees, and Factorizations Peter Bartlett. October 2003. These notes present some properties of chordal graphs, a set of undirected
More informationin Information Retrieval as a problem of evidence and prediction based on Traditional probabilistic models construct a discriminant
ayesian pproach to User Proling in Information Retrieval S.K.M. Wong epartment of omputer Science University of Regina Regina, Saskatchewan, anada, S4S 02 wong@cs.uregina.ca.j. utz School of Information
More informationALGORITHMS FOR DECISION SUPPORT
GORIHM FOR IION UOR ayesian networks Guest ecturer: ilja Renooij hanks to hor Whalen or kindly contributing to these slides robabilistic Independence onditional Independence onditional Independence hain
More informationA Well-Behaved Algorithm for Simulating Dependence Structures of Bayesian Networks
A Well-Behaved Algorithm for Simulating Dependence Structures of Bayesian Networks Yang Xiang and Tristan Miller Department of Computer Science University of Regina Regina, Saskatchewan, Canada S4S 0A2
More informationMaximal Prime Subgraph Decomposition of Bayesian Networks
From: FLAIRS-01 Proceedings. Copyright 2001, AAAI (www.aaai.org). All rights reserved. Maximal Prime Subgraph Decomposition of Bayesian Networks Kristian G. Olesen Anders L. Madsen Department of Computer
More informationLecture 4: Undirected Graphical Models
Lecture 4: Undirected Graphical Models Department of Biostatistics University of Michigan zhenkewu@umich.edu http://zhenkewu.com/teaching/graphical_model 15 September, 2016 Zhenke Wu BIOSTAT830 Graphical
More informationA New Approach For Convert Multiply-Connected Trees in Bayesian networks
A New Approach For Convert Multiply-Connected Trees in Bayesian networks 1 Hussein Baloochian, Alireza khantimoory, 2 Saeed Balochian 1 Islamic Azad university branch of zanjan 2 Islamic Azad university
More informationByzantine Consensus in Directed Graphs
Byzantine Consensus in Directed Graphs Lewis Tseng 1,3, and Nitin Vaidya 2,3 1 Department of Computer Science, 2 Department of Electrical and Computer Engineering, and 3 Coordinated Science Laboratory
More informationBayesian Networks, Winter Yoav Haimovitch & Ariel Raviv
Bayesian Networks, Winter 2009-2010 Yoav Haimovitch & Ariel Raviv 1 Chordal Graph Warm up Theorem 7 Perfect Vertex Elimination Scheme Maximal cliques Tree Bibliography M.C.Golumbic Algorithmic Graph Theory
More informationExact Algorithms Lecture 7: FPT Hardness and the ETH
Exact Algorithms Lecture 7: FPT Hardness and the ETH February 12, 2016 Lecturer: Michael Lampis 1 Reminder: FPT algorithms Definition 1. A parameterized problem is a function from (χ, k) {0, 1} N to {0,
More informationComplexity Results on Graphs with Few Cliques
Discrete Mathematics and Theoretical Computer Science DMTCS vol. 9, 2007, 127 136 Complexity Results on Graphs with Few Cliques Bill Rosgen 1 and Lorna Stewart 2 1 Institute for Quantum Computing and School
More informationPACKING DIGRAPHS WITH DIRECTED CLOSED TRAILS
PACKING DIGRAPHS WITH DIRECTED CLOSED TRAILS PAUL BALISTER Abstract It has been shown [Balister, 2001] that if n is odd and m 1,, m t are integers with m i 3 and t i=1 m i = E(K n) then K n can be decomposed
More informationFMA901F: Machine Learning Lecture 6: Graphical Models. Cristian Sminchisescu
FMA901F: Machine Learning Lecture 6: Graphical Models Cristian Sminchisescu Graphical Models Provide a simple way to visualize the structure of a probabilistic model and can be used to design and motivate
More informationThe Encoding Complexity of Network Coding
The Encoding Complexity of Network Coding Michael Langberg Alexander Sprintson Jehoshua Bruck California Institute of Technology Email: mikel,spalex,bruck @caltech.edu Abstract In the multicast network
More informationCONNECTIVITY AND NETWORKS
CONNECTIVITY AND NETWORKS We begin with the definition of a few symbols, two of which can cause great confusion, especially when hand-written. Consider a graph G. (G) the degree of the vertex with smallest
More informationLecture 2 - Graph Theory Fundamentals - Reachability and Exploration 1
CME 305: Discrete Mathematics and Algorithms Instructor: Professor Aaron Sidford (sidford@stanford.edu) January 11, 2018 Lecture 2 - Graph Theory Fundamentals - Reachability and Exploration 1 In this lecture
More informationTreewidth and graph minors
Treewidth and graph minors Lectures 9 and 10, December 29, 2011, January 5, 2012 We shall touch upon the theory of Graph Minors by Robertson and Seymour. This theory gives a very general condition under
More informationAlgorithms. Definition: An algorithm is a set of rules followed to solve a problem. In general, an algorithm has the steps:
Matchings 7.2 99 lgorithms efinition: n algorithm is a set of rules followed to solve a problem. In general, an algorithm has the steps: 1 Organize the input. 2 Repeatedly apply some steps until a termination
More informationAv. Prof. Mello Moraes, 2231, , São Paulo, SP - Brazil
" Generalizing Variable Elimination in Bayesian Networks FABIO GAGLIARDI COZMAN Escola Politécnica, University of São Paulo Av Prof Mello Moraes, 31, 05508-900, São Paulo, SP - Brazil fgcozman@uspbr Abstract
More informationOn Covering a Graph Optimally with Induced Subgraphs
On Covering a Graph Optimally with Induced Subgraphs Shripad Thite April 1, 006 Abstract We consider the problem of covering a graph with a given number of induced subgraphs so that the maximum number
More informationAn Effective Upperbound on Treewidth Using Partial Fill-in of Separators
An Effective Upperbound on Treewidth Using Partial Fill-in of Separators Boi Faltings Martin Charles Golumbic June 28, 2009 Abstract Partitioning a graph using graph separators, and particularly clique
More informationAND/OR Cutset Conditioning
ND/OR utset onditioning Robert Mateescu and Rina Dechter School of Information and omputer Science University of alifornia, Irvine, 92697 {mateescu, dechter}@ics.uci.edu bstract utset conditioning is one
More informationFaster parameterized algorithms for Minimum Fill-In
Faster parameterized algorithms for Minimum Fill-In Hans L. Bodlaender Pinar Heggernes Yngve Villanger Technical Report UU-CS-2008-042 December 2008 Department of Information and Computing Sciences Utrecht
More information2 Review of Set Theory
2 Review of Set Theory Example 2.1. Let Ω = {1, 2, 3, 4, 5, 6} 2.2. Venn diagram is very useful in set theory. It is often used to portray relationships between sets. Many identities can be read out simply
More informationMarkov Equivalence in Bayesian Networks
Markov Equivalence in Bayesian Networks Ildikó Flesch and eter Lucas Institute for Computing and Information Sciences University of Nijmegen Email: {ildiko,peterl}@cs.kun.nl Abstract robabilistic graphical
More informationNumber Theory and Graph Theory
1 Number Theory and Graph Theory Chapter 6 Basic concepts and definitions of graph theory By A. Satyanarayana Reddy Department of Mathematics Shiv Nadar University Uttar Pradesh, India E-mail: satya8118@gmail.com
More informationVertical decomposition of a lattice using clique separators
Vertical decomposition of a lattice using clique separators Anne Berry, Romain Pogorelcnik, Alain Sigayret LIMOS UMR CNRS 6158 Ensemble Scientifique des Cézeaux Université Blaise Pascal, F-63 173 Aubière,
More informationRigidity, connectivity and graph decompositions
First Prev Next Last Rigidity, connectivity and graph decompositions Brigitte Servatius Herman Servatius Worcester Polytechnic Institute Page 1 of 100 First Prev Next Last Page 2 of 100 We say that a framework
More informationLecture 13: May 10, 2002
EE96 Pat. Recog. II: Introduction to Graphical Models University of Washington Spring 00 Dept. of Electrical Engineering Lecture : May 0, 00 Lecturer: Jeff Bilmes Scribe: Arindam Mandal, David Palmer(000).
More informationLoopy Belief Propagation
Loopy Belief Propagation Research Exam Kristin Branson September 29, 2003 Loopy Belief Propagation p.1/73 Problem Formalization Reasoning about any real-world problem requires assumptions about the structure
More informationDomination, Independence and Other Numbers Associated With the Intersection Graph of a Set of Half-planes
Domination, Independence and Other Numbers Associated With the Intersection Graph of a Set of Half-planes Leonor Aquino-Ruivivar Mathematics Department, De La Salle University Leonorruivivar@dlsueduph
More informationA note on the pairwise Markov condition in directed Markov fields
TECHNICAL REPORT R-392 April 2012 A note on the pairwise Markov condition in directed Markov fields Judea Pearl University of California, Los Angeles Computer Science Department Los Angeles, CA, 90095-1596,
More information2386 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 52, NO. 6, JUNE 2006
2386 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 52, NO. 6, JUNE 2006 The Encoding Complexity of Network Coding Michael Langberg, Member, IEEE, Alexander Sprintson, Member, IEEE, and Jehoshua Bruck,
More informationFaster parameterized algorithms for Minimum Fill-In
Faster parameterized algorithms for Minimum Fill-In Hans L. Bodlaender Pinar Heggernes Yngve Villanger Abstract We present two parameterized algorithms for the Minimum Fill-In problem, also known as Chordal
More informationResearch Article Structural Learning about Directed Acyclic Graphs from Multiple Databases
Abstract and Applied Analysis Volume 2012, Article ID 579543, 9 pages doi:10.1155/2012/579543 Research Article Structural Learning about Directed Acyclic Graphs from Multiple Databases Qiang Zhao School
More informationK 4 C 5. Figure 4.5: Some well known family of graphs
08 CHAPTER. TOPICS IN CLASSICAL GRAPH THEORY K, K K K, K K, K K, K C C C C 6 6 P P P P P. Graph Operations Figure.: Some well known family of graphs A graph Y = (V,E ) is said to be a subgraph of a graph
More informationMarkov Random Fields
3750 Machine earning ecture 4 Markov Random ields Milos auskrecht milos@cs.pitt.edu 5329 ennott quare 3750 dvanced Machine earning Markov random fields Probabilistic models with symmetric dependences.
More informationCS242: Probabilistic Graphical Models Lecture 3: Factor Graphs & Variable Elimination
CS242: Probabilistic Graphical Models Lecture 3: Factor Graphs & Variable Elimination Instructor: Erik Sudderth Brown University Computer Science September 11, 2014 Some figures and materials courtesy
More informationSample Solutions to Homework #2
National aiwan University andout #1 epartment of lectrical ngineering November, 01 lgorithms, Fall 01 : Zhi-en in and Yen-hun iu ample olutions to omework # 1. (15) (a) ee Figure 1. 3 1 3 1 3 1 3 1 1 1
More informationAn Eternal Domination Problem in Grids
Theory and Applications of Graphs Volume Issue 1 Article 2 2017 An Eternal Domination Problem in Grids William Klostermeyer University of North Florida, klostermeyer@hotmail.com Margaret-Ellen Messinger
More informationTCOM 501: Networking Theory & Fundamentals. Lecture 11 April 16, 2003 Prof. Yannis A. Korilis
TOM 50: Networking Theory & undamentals Lecture pril 6, 2003 Prof. Yannis. Korilis 2 Topics Routing in ata Network Graph Representation of a Network Undirected Graphs Spanning Trees and Minimum Weight
More informationProbabilistic Graphical Models
Overview of Part One Probabilistic Graphical Models Part One: Graphs and Markov Properties Christopher M. Bishop Graphs and probabilities Directed graphs Markov properties Undirected graphs Examples Microsoft
More informationIrregular Interval Valued Fuzzy Graphs
nnals of Pure and pplied Mathematics Vol 3, No, 03, 56-66 ISSN: 79-087X (P), 79-0888(online) Published on 0 May 03 wwwresearchmathsciorg nnals of Irregular Interval Valued Fuzzy Graphs Madhumangal Pal
More informationDisjoint directed cycles
Disjoint directed cycles Noga Alon Abstract It is shown that there exists a positive ɛ so that for any integer k, every directed graph with minimum outdegree at least k contains at least ɛk vertex disjoint
More informationMaximal Monochromatic Geodesics in an Antipodal Coloring of Hypercube
Maximal Monochromatic Geodesics in an Antipodal Coloring of Hypercube Kavish Gandhi April 4, 2015 Abstract A geodesic in the hypercube is the shortest possible path between two vertices. Leader and Long
More informationCS473-Algorithms I. Lecture 13-A. Graphs. Cevdet Aykanat - Bilkent University Computer Engineering Department
CS473-Algorithms I Lecture 3-A Graphs Graphs A directed graph (or digraph) G is a pair (V, E), where V is a finite set, and E is a binary relation on V The set V: Vertex set of G The set E: Edge set of
More informationFundamental Properties of Graphs
Chapter three In many real-life situations we need to know how robust a graph that represents a certain network is, how edges or vertices can be removed without completely destroying the overall connectivity,
More information6 : Factor Graphs, Message Passing and Junction Trees
10-708: Probabilistic Graphical Models 10-708, Spring 2018 6 : Factor Graphs, Message Passing and Junction Trees Lecturer: Kayhan Batmanghelich Scribes: Sarthak Garg 1 Factor Graphs Factor Graphs are graphical
More informationOn the Relationships between Zero Forcing Numbers and Certain Graph Coverings
On the Relationships between Zero Forcing Numbers and Certain Graph Coverings Fatemeh Alinaghipour Taklimi, Shaun Fallat 1,, Karen Meagher 2 Department of Mathematics and Statistics, University of Regina,
More informationDiscrete Applied Mathematics. A revision and extension of results on 4-regular, 4-connected, claw-free graphs
Discrete Applied Mathematics 159 (2011) 1225 1230 Contents lists available at ScienceDirect Discrete Applied Mathematics journal homepage: www.elsevier.com/locate/dam A revision and extension of results
More informationLecture 15: The subspace topology, Closed sets
Lecture 15: The subspace topology, Closed sets 1 The Subspace Topology Definition 1.1. Let (X, T) be a topological space with topology T. subset of X, the collection If Y is a T Y = {Y U U T} is a topology
More informationGeneral Models for Optimum Arbitrary-Dimension FPGA Switch Box Designs
General Models for Optimum Arbitrary-Dimension FPGA Switch Box Designs Hongbing Fan Dept. of omputer Science University of Victoria Victoria B anada V8W P6 Jiping Liu Dept. of Math. & omp. Sci. University
More informationThe External Network Problem
The External Network Problem Jan van den Heuvel and Matthew Johnson CDAM Research Report LSE-CDAM-2004-15 December 2004 Abstract The connectivity of a communications network can often be enhanced if the
More informationAnalysis of Algorithms Prof. Karen Daniels
UMass Lowell omputer Science 91.404 nalysis of lgorithms Prof. Karen aniels Spring, 2013 hapter 22: raph lgorithms & rief Introduction to Shortest Paths [Source: ormen et al. textbook except where noted]
More informationCompiling Constraint Networks into AND/OR Multi-Valued Decision Diagrams (AOMDDs)
ompiling onstraint Networks into N/OR Multi-Valued ecision iagrams (OMs) Robert Mateescu and Rina echter onald ren School of Information and omputer Science University of alifornia, Irvine, 92697-3425
More informationLearning Graphical Models by Extending Optimal Spanning Trees
Learning Graphical Models by Extending Optimal Spanning Trees hristian orgelt and Rudolf Kruse ept. of Knowledge Processing and Language Engineering Otto-von-Guericke-University of Magdeburg Universitätsplatz
More informationarxiv: v5 [math.co] 5 Oct 2017
Clique trees of infinite locally finite chordal graphs Christoph Hofer-Temmel and Florian Lehner arxiv:1311.7001v5 [math.co] 5 Oct 2017 Abstract We investigate clique trees of infinite locally finite chordal
More information9.5 Equivalence Relations
9.5 Equivalence Relations You know from your early study of fractions that each fraction has many equivalent forms. For example, 2, 2 4, 3 6, 2, 3 6, 5 30,... are all different ways to represent the same
More informationCore Membership Computation for Succinct Representations of Coalitional Games
Core Membership Computation for Succinct Representations of Coalitional Games Xi Alice Gao May 11, 2009 Abstract In this paper, I compare and contrast two formal results on the computational complexity
More informationPAijpam.eu PRIME CORDIAL LABELING OF THE GRAPHS RELATED TO CYCLE WITH ONE CHORD, TWIN CHORDS AND TRIANGLE G.V. Ghodasara 1, J.P.
International Journal of Pure and Applied Mathematics Volume 89 No. 1 2013, 79-87 ISSN: 1311-8080 (printed version); ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu doi: http://dx.doi.org/10.12732/ijpam.v89i1.9
More informationA CSP Search Algorithm with Reduced Branching Factor
A CSP Search Algorithm with Reduced Branching Factor Igor Razgon and Amnon Meisels Department of Computer Science, Ben-Gurion University of the Negev, Beer-Sheva, 84-105, Israel {irazgon,am}@cs.bgu.ac.il
More informationFigure 1.1: This is an illustration of a generic set and its elements.
Chapter 1 Mathematical Review et theory is now generally accepted as the foundation of modern mathematics, and it plays an instrumental role in the treatment of probability. Unfortunately, a simple description
More informationOn vertex types of graphs
On vertex types of graphs arxiv:1705.09540v1 [math.co] 26 May 2017 Pu Qiao, Xingzhi Zhan Department of Mathematics, East China Normal University, Shanghai 200241, China Abstract The vertices of a graph
More informationThe strong chromatic number of a graph
The strong chromatic number of a graph Noga Alon Abstract It is shown that there is an absolute constant c with the following property: For any two graphs G 1 = (V, E 1 ) and G 2 = (V, E 2 ) on the same
More informationJunction tree propagation - BNDG 4-4.6
Junction tree propagation - BNDG 4-4. Finn V. Jensen and Thomas D. Nielsen Junction tree propagation p. 1/2 Exact Inference Message Passing in Join Trees More sophisticated inference technique; used in
More information3 No-Wait Job Shops with Variable Processing Times
3 No-Wait Job Shops with Variable Processing Times In this chapter we assume that, on top of the classical no-wait job shop setting, we are given a set of processing times for each operation. We may select
More informationReview of Sets. Review. Philippe B. Laval. Current Semester. Kennesaw State University. Philippe B. Laval (KSU) Sets Current Semester 1 / 16
Review of Sets Review Philippe B. Laval Kennesaw State University Current Semester Philippe B. Laval (KSU) Sets Current Semester 1 / 16 Outline 1 Introduction 2 Definitions, Notations and Examples 3 Special
More informationTrees. 3. (Minimally Connected) G is connected and deleting any of its edges gives rise to a disconnected graph.
Trees 1 Introduction Trees are very special kind of (undirected) graphs. Formally speaking, a tree is a connected graph that is acyclic. 1 This definition has some drawbacks: given a graph it is not trivial
More informationMassachusetts Institute of Technology Department of Electrical Engineering and Computer Science Algorithms For Inference Fall 2014
Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science 6.438 Algorithms For Inference Fall 2014 Recitation-6: Hardness of Inference Contents 1 NP-Hardness Part-II
More informationGraph Theory: Introduction
Graph Theory: Introduction Pallab Dasgupta, Professor, Dept. of Computer Sc. and Engineering, IIT Kharagpur pallab@cse.iitkgp.ernet.in Resources Copies of slides available at: http://www.facweb.iitkgp.ernet.in/~pallab
More informationProgress Towards the Total Domination Game 3 4 -Conjecture
Progress Towards the Total Domination Game 3 4 -Conjecture 1 Michael A. Henning and 2 Douglas F. Rall 1 Department of Pure and Applied Mathematics University of Johannesburg Auckland Park, 2006 South Africa
More informationRepresentation of Finite Games as Network Congestion Games
Representation of Finite Games as Network Congestion Games Igal Milchtaich To cite this version: Igal Milchtaich. Representation of Finite Games as Network Congestion Games. Roberto Cominetti and Sylvain
More informationOn the Practical Significance of Hypertree vs Tree Width
On the Practical Significance of Hypertree vs Tree Width Rina Dechter 1, Lars Otten 1, and Radu Marinescu 2 bstract. In 2000, [4] presented a new graph parameter, the hypertree width, and showed that it
More informationNOTE ON MINIMALLY k-connected GRAPHS
NOTE ON MINIMALLY k-connected GRAPHS R. Rama a, Suresh Badarla a a Department of Mathematics, Indian Institute of Technology, Chennai, India ABSTRACT A k-tree is either a complete graph on (k+1) vertices
More informationACO Comprehensive Exam March 19 and 20, Computability, Complexity and Algorithms
1. Computability, Complexity and Algorithms Bottleneck edges in a flow network: Consider a flow network on a directed graph G = (V,E) with capacities c e > 0 for e E. An edge e E is called a bottleneck
More informationAcyclic Network. Tree Based Clustering. Tree Decomposition Methods
Summary s Join Tree Importance of s Solving Topological structure defines key features for a wide class of problems CSP: Inference in acyclic network is extremely efficient (polynomial) Idea: remove cycles
More informationNecessary edges in k-chordalizations of graphs
Necessary edges in k-chordalizations of graphs Hans L. Bodlaender Abstract In this note, we look at which edges must always be added to a given graph G = (V, E), when we want to make it a chordal graph
More informationEnumerating the decomposable neighbours of a decomposable graph under a simple perturbation scheme
Enumerating the decomposable neighbours of a decomposable graph under a simple perturbation scheme Alun Thomas Department of Biomedical Informatics University of Utah Peter J Green Department of Mathematics
More informationParameterized graph separation problems
Parameterized graph separation problems Dániel Marx Department of Computer Science and Information Theory, Budapest University of Technology and Economics Budapest, H-1521, Hungary, dmarx@cs.bme.hu Abstract.
More information5 Graph Theory Basics
November 14, 2017 5 Graph Theory Basics William T. Trotter trotter@math.gatech.edu Basic Definitions Definition A graph G is a pair (V, E) where V is a finite set and E is a set of 2-element subsets of
More informationLecture 11: May 1, 2000
/ EE596 Pat. Recog. II: Introduction to Graphical Models Spring 2000 Lecturer: Jeff Bilmes Lecture 11: May 1, 2000 University of Washington Dept. of Electrical Engineering Scribe: David Palmer 11.1 Graph
More informationIntroduction to Graph Theory
Introduction to Graph Theory Tandy Warnow January 20, 2017 Graphs Tandy Warnow Graphs A graph G = (V, E) is an object that contains a vertex set V and an edge set E. We also write V (G) to denote the vertex
More informationGraphs: Introduction. Ali Shokoufandeh, Department of Computer Science, Drexel University
Graphs: Introduction Ali Shokoufandeh, Department of Computer Science, Drexel University Overview of this talk Introduction: Notations and Definitions Graphs and Modeling Algorithmic Graph Theory and Combinatorial
More informationPATTERN RECOGNITION AND MACHINE LEARNING CHAPTER 8: GRAPHICAL MODELS
PATTERN RECOGNITION AND MACHINE LEARNING CHAPTER 8: GRAPHICAL MODELS Bayesian Networks Directed Acyclic Graph (DAG) Bayesian Networks General Factorization Bayesian Curve Fitting (1) Polynomial Bayesian
More informationEvery planar graph is 4-colourable and 5-choosable a joint proof
Peter Dörre Fachhochschule Südwestfalen (University of Applied Sciences) Frauenstuhlweg, D-58644 Iserlohn, Germany doerre@fh-swf.de Mathematics Subject Classification: 05C5 Abstract A new straightforward
More informationMinimum-Spanning-Tree problem. Minimum Spanning Trees (Forests) Minimum-Spanning-Tree problem
Minimum Spanning Trees (Forests) Given an undirected graph G=(V,E) with each edge e having a weight w(e) : Find a subgraph T of G of minimum total weight s.t. every pair of vertices connected in G are
More informationExtremal Graph Theory: Turán s Theorem
Bridgewater State University Virtual Commons - Bridgewater State University Honors Program Theses and Projects Undergraduate Honors Program 5-9-07 Extremal Graph Theory: Turán s Theorem Vincent Vascimini
More informationAcyclic Network. Tree Based Clustering. Tree Decomposition Methods
Summary s Cluster Tree Elimination Importance of s Solving Topological structure dene key features for a wide class of problems CSP: Inference in acyclic network is extremely ecient (polynomial) Idea:
More informationSection 3.1: Nonseparable Graphs Cut vertex of a connected graph G: A vertex x G such that G x is not connected. Theorem 3.1, p. 57: Every connected
Section 3.1: Nonseparable Graphs Cut vertex of a connected graph G: A vertex x G such that G x is not connected. Theorem 3.1, p. 57: Every connected graph G with at least 2 vertices contains at least 2
More informationSparse Hypercube 3-Spanners
Sparse Hypercube 3-Spanners W. Duckworth and M. Zito Department of Mathematics and Statistics, University of Melbourne, Parkville, Victoria 3052, Australia Department of Computer Science, University of
More informationEscola Politécnica, University of São Paulo Av. Prof. Mello Moraes, 2231, , São Paulo, SP - Brazil
Generalizing Variable Elimination in Bayesian Networks FABIO GAGLIARDI COZMAN Escola Politécnica, University of São Paulo Av. Prof. Mello Moraes, 2231, 05508-900, São Paulo, SP - Brazil fgcozman@usp.br
More informationMachine Learning Lecture 16
ourse Outline Machine Learning Lecture 16 undamentals (2 weeks) ayes ecision Theory Probability ensity stimation Undirected raphical Models & Inference 28.06.2016 iscriminative pproaches (5 weeks) Linear
More information6c Lecture 3 & 4: April 8 & 10, 2014
6c Lecture 3 & 4: April 8 & 10, 2014 3.1 Graphs and trees We begin by recalling some basic definitions from graph theory. Definition 3.1. A (undirected, simple) graph consists of a set of vertices V and
More informationChordal Graphs: Theory and Algorithms
Chordal Graphs: Theory and Algorithms 1 Chordal graphs Chordal graph : Every cycle of four or more vertices has a chord in it, i.e. there is an edge between two non consecutive vertices of the cycle. Also
More informationConnection and separation in hypergraphs
Theory and Applications of Graphs Volume 2 Issue 2 Article 5 2015 Connection and separation in hypergraphs Mohammad A. Bahmanian Illinois State University, mbahman@ilstu.edu Mateja Sajna University of
More informationOn the Max Coloring Problem
On the Max Coloring Problem Leah Epstein Asaf Levin May 22, 2010 Abstract We consider max coloring on hereditary graph classes. The problem is defined as follows. Given a graph G = (V, E) and positive
More informationResearch Question Presentation on the Edge Clique Covers of a Complete Multipartite Graph. Nechama Florans. Mentor: Dr. Boram Park
Research Question Presentation on the Edge Clique Covers of a Complete Multipartite Graph Nechama Florans Mentor: Dr. Boram Park G: V 5 Vertex Clique Covers and Edge Clique Covers: Suppose we have a graph
More informationDiscrete mathematics
Discrete mathematics Petr Kovář petr.kovar@vsb.cz VŠB Technical University of Ostrava DiM 470-2301/02, Winter term 2018/2019 About this file This file is meant to be a guideline for the lecturer. Many
More informationNote: Simultaneous Graph Parameters: Factor Domination and Factor Total Domination
Note: Simultaneous Graph Parameters: Factor Domination and Factor Total Domination Peter Dankelmann a Michael A. Henning b Wayne Goddard c Renu Laskar d a School of Mathematical Sciences, University of
More information