CHAPTER-2 A GRAPH BASED APPROACH TO FIND CANDIDATE KEYS IN A RELATIONAL DATABASE SCHEME **
|
|
- Lucas Daniel
- 5 years ago
- Views:
Transcription
1 HPTR- GRPH S PPROH TO FIN NIT KYS IN RLTIONL TS SHM **. INTROUTION Graphs have many applications in the field of knowledge and data engineering. There are many graph based approaches used in database management system, ranging from -R modeling to database schema design and normalization [8][0][5][7][8] [4][5]. Functional dependencies among the entities of a context problem area can be easily represented as a graph called the functional dependence graph (FG). part from database technology, FGs have many applications in Web data analysis [], Language processing [], ata cleaning [6], Network Theory [7] and ata Mining [9]. There are several types of generalized graphs such as F graph, Implication graph, and eduction graphs, etc. used to study functional dependencies. Hyper graph is another generalized graph that can be used to study functional dependencies []. There are many algorithms for finding all candidate keys of a relational scheme based on Karnaugh map [3], oolean matrix [4] and other set theoretic approaches [0]. Hossein Saiedian, et.al, described a method for finding the candidate keys in a relational scheme [9]. In their approach, the functional dependencies among the attributes in a database table can be represented as a graph. Such graphs are also called attribute graphs. They use the attribute graph for analyzing the dependencies to find the candidate keys. Their approach cannot find all the candidate keys of a relational scheme ** This chapter has been published as a research paper in the journal International Journal of omputer ngineering &Technology (IJT), Vol-4, issue- 6, pp.9-3, 04
2 if the F graph is strongly connected. Their approach needs a minimal set Fs to compute the candidate keys. In this chapter, a generalized graph based method to find all candidate keys in a relational database scheme is presented.. FUNTIONL PNNIS N THIR GRPHS Let be a functional dependency, where, are sets of attributes. epending on the cardinality of and the following graph patterns are obtained for the F... If and both are singular, i.e., = = then the graph pattern shown in fig..(a) is obtained... If = and > and = {,, n, then the graph pattern shown in fig..(b) is obtained...3 a) If > and = and ={,, n then the graph pattern shown in fig..(c) is obtained b) If > and > and ={,, n and ={,, n,then the graph pattern shown in fig..(d) is obtained. (a): Graph for n (b): Graph for.. n n (c): Graph for (d): Graph for n n, n n :onnector Node n Figure.: Functional ependencies and Their Graphs
3 Note that there are dependencies from a connector node to all components (nodes) of it. In fig., the following dependencies are also existed (,,.., n )..3 FUNTIONL PNNY GRPHS (FG) FOR RLTIONL TS SHM The functional dependency graph (FG) for a relational scheme is drawn based on the set of functional dependencies available in the relational scheme using the rules..,.., and..3. One node is created for each attribute in the relation scheme. connector-node is created each time the Rule..3 is applied, i.e. for each distinct nonsingular attribute set which is in the left-hand side of a F. Therefore, for a relational scheme R with N attributes with a set of Fs F and having M distinct non-singular attribute sets in the left-hand side of the Fs in F there will be N+M nodes in the FG. For example, for a relational scheme R= (,,,, ) with the set Fs F= {,,, a FG, as shown in fig.., with a total of 6 nodes is obtained. Figure.: F Graph for a relational scheme R= (,,,, ) with the set Fs F= {,,,.4 FINING TH NIT KYS USING FG To find the candidate keys from the FG, the following transformations are performed in the FG.
4 T: If there is a dependency c i c j, c i, c j { then remove c j from {. elete the connector node from the G if { is singular. ssign all edges of to c. The transformation process has two phases- ugmentation and Reduction. fter the transformation, the resultant graph contains only the candidate nodes. candidate node is a node which alone or along with some other candidate nodes, can determine all other nodes in the graph. Therefore the resultant graph is called the andidate Graph (G ). So, the problem now is to find the candidate graph from an FG. Therefore the transformation process can be represented as follows: G G G..4. ugmentation: Finding G. In the augmentation phase new connector nodes and edges are added to the FG by performing the following transformations. T: Let there exists a connector-type node which connect the node set ={c i,,<i n, and has an outgoing edge to a node. Let there exists a node in the FG from which there is a path to any node c i in. S-I: If there is a path from to c i, i, i n,then an edge from to is added where n is the cardinality of the set. S-II: If there is a path from to a set {c k, <i<n and c k <n where n is the cardinality of, then for each c k,a new connector node is created connecting node and the nodes in the set {- c k and an edge from to is added. Fig..3 shows the transformation process. of the FG for a relational scheme R= (,,,, ) with the set Fs F= {,,,. Node has a path to both components and of the set represented by the connector node, so
5 an edge from to the connector node is added due to case-i of the transformation T. Node has a path to only one component of the set represented by the connector node, so a new connector node is created to connect node and node and an edge from to the is added due to case-ii of the transformation T. (G) (G + ) : dge due to T (case-i) : dge due to T (case-ii) : Node created due to T (case-ii) Figure.3: Transformation T (ugmentation).4. Reduction: Finding G. In the reduction phase certain nodes and edges are deleted from the augmented FG by performing the following transformations. T3: Let be a connector node in G. If there is a node in G which has a direct edge to node, then delete all edges from to the first node in the paths to any c i. T4: elete a node N from the augmented FG G if its in-degree >0 and out-degree =0. In fig..4(b), first node is deleted because its in-degree is non zero and outdegree is zero. eletion of this node causes the deletion of the nodes and from the graph. T5: elete a cycle K from G if in-degree (K) >0 and out-degree (K) =0.
6 (a): xample of Transformation T3 3 (b): eletion of nodes,, Using Transformation rule T4 F F G G (i) (ii) (c) : ycle deletion using Transformation T5 Figure.4: Transformations in Reduction Process The following example in fig..5 explains the transformation process. Let R= (,,,, ) be a relational scheme with the set Fs F= {,,,. With this set of Fs F, the F graph G is obtained by using rule.,. and.3 discussed in section- of this paper. fter the transformation process the candidate graph G is obtained. From G it is clear that there is cycle having all the nodes in the graph. The candidate nodes are,, and. Therefore R= (,,,, ) with the set of Fs F= {,,, has four candidate keys-,,, and. (G) T (G + ) T3 T4 (G ) Figure.5: The Transformation Process to find the candidate keys of relational scheme R= (,,,, ) with the set Fs F= {,,,.
7 .5 FINITION N THORMS The following definition and theorems are presented with respect to the andidate graph G..5. efinition : node in a cycle in a candidate graph G of a relational scheme R is either a candidate key or a part of the candidate keys of R..5. Theorem : G=G iff one of the following conditions is satisfied. i. F= ii. G has a cycle having all the nodes in the cycle and there is no connector node. Proof: Let R= {,, n ) be a relational scheme with a set of Fs, F. Let G be the F graph for R. ase (i): If F=, i,j, i j, i j F, so the FG G has n isolated nodes and G remains unchanged during the ugmentation process and the Reduction process. Therefore, G=G (q..) G + =G (q..) Hence G=G (from q.. and q..) ase (ii): Now if F and there is a chain i,j, i j, i j i then no new connector nodes can be added during the ugmentation process, which gives. G=G (q..3) Similarly, no node of the graph G + is deleted during the reduction process, because there exists no node α i, i n such that in-degree(α i )>0 and out-degree(α i )=0. Hence, G + =G (q..4) Therefore, from q..3 & q..4, it is found that G=G //
8 .5.3 Theorem : In a candidate graph G, a candidate node cannot have edges if the node does not belong to a cycle. Proof: Let be the only candidate node in the candidate graph, G. So, is an isolated node. Therefore, In-degree () =Out-degree () = (q..5) Now, let there are two candidate nodes and in G. Here, two possibilities are available: a) Node and node both may be isolated or b) and are connected. In case (b) it is found that, if in-degree () = and out-degree () =0 then node cannot be survived in G due to transformation T4. Similarly, if in-degree () = and outdegree () =0 then node cannot survive in G due to transformation T4. Therefore, both nodes and can survive in G if they form a cycle. in-degree ()=out-degree()= in-degree()= out-degree()= (q..6) Therefore, nodes and can have edges if they are in a cycle. Otherwise they are isolated nodes. //.5.4 Theorem 3: If the andidate graph, G, of a relational scheme R has only one cycle and if all the nodes of G are in the cycle, then every attribute of R is a candidate key. Proof: Let V V V 3.V n- V n- V n V is the cycle in the andidate graph G with n vertices. In this chain, from any node V i there is a path to any node V j, j i and < j n by transitivity rule. Therefore, from any V i, < i n, all other nodes V j,< j n and j i are reachable, where n is the degree of R.
9 (a) (b) Figure.6: yclic andidate Graphs having only one cycle In fig..6(a), nodes,, both are candidate nodes. From node, node is reachable and from node, is reachable. In fig..6(b), nodes,,, and all are candidate nodes. From node, nodes,, are reachable i.e., node can functionally determine,, and. So, node is a candidate key. Similarly, from node, nodes,, are reachable i.e., node can functionally determine,,. So, node is also a candidate key. //.5.5 Theorem 4: If the andidate graph G has disconnected components, then the artesian product of the candidate nodes of each component is the set of all candidate keys. Proof: Let us consider a relation scheme R= {,, n ) with a set of Fs, F=. Since F=, there are n disjoint components in the G for R (by Theorem.4.4). The candidate key k for R is the artesian product all attributes of the relational scheme. Therefore, k= n (q..7) Now, let F, then a candidate graph G for R is obtained. Let be the set of m<n (since F, some nodes will be deleted or there will be at least one cycle in G ) disjoint components in G c such that = {{c, {c,., {c m. The component c i can be considered as a set. y Theorem-.4.4, if the candidate graph contains disjoint components then they must be either isolated nodes or cycles. If these disjoint components are considered as nodes, then the set of functional dependencies F available
10 among these components, is null, i.e. F=. Therefore, by q.-.7, it is obvious that, the set of candidate keys K= {{c {c. {c m. // c c c c 4 (a) c 3 (b) Figure.7: andidate graphs with isjoint omponents c In fig..7, an FG with disjoint components is shown. In fig..7(a) {{ { { { = { is the candidate key. ut in fig..7(b), {{ {,, = {{, {, { is the set of candidate keys..5.6 Theorem 5: relational scheme R has multiple candidate keys if and only if the andidate graph G for R contains at least one cycle. Proof: Let G c be the candidate graph for a relational scheme R, with n components,, n. Let K be the set of candidate keys of R. ach component i can be considered as a set of nodes. y Theorem.4.3 K={ n.. (q..7) Now by definition the following equation is obtained. k > if k is a cycle. (q..8) From equation 3, K = if i, i n, i =. (q..9) K > if k, k n k > (q..0) From q.-.9 and q.-.0, it is clear that K is non- singular if and only if there exists at least one cyclic component k, k n, in G c. // Figure-.8 shows all possible cyclic candidate graphs for a relational scheme R= (,,, ).
11 (a) (b) (c) (d) (e) (f) (g) (h) (i) (j) (k) (l) (m ) (n) Figure.8: andidate Graphs for R= (,,, ) having ycles.6 NLYSIS OF TH PPROH.6. Out Line Of The pproach In the approach, a candidate graph G is obtained from an FG G by using the transformation rules described here. ut G cannot be obtained from G since all functional dependencies except the dependencies among the candidate nodes are deleted, i.e., G does not include all dependencies which imply the original set of Fs F. Though G cannot be obtained from G, the transformations applied in the FG drawn from the set of Fs F do not generate any extra dependencies that are not members of the closure of F, F. Moreover, in this graph based approach, it is not required to calculate F, the closure of F and F, the canonical cover of F. The approach can be implemented by the following algorithms. The outline of the approach is shown in fig..9. raw the FG (G) from the F set ugment G by adding onnector Nodes. G G Reduce G to get G G G Figure.9: Outline of the pproach
12 .6. Procedure Make-FG=(R(,, n ),,F,G) { G= ; For each R create a node for in G; If ( F ) then { For all ( ) F { If ( = N =) then dd an edge from node to in G; If ( = N ) then For all b add an edge from node to b in G { If ( > N ) then { reate a new connector node to connect all { ; Put an undirected edge from all a { to ; dd an edge from node to each b { ; elete the edge from node to node from F; Figure.0: lgorithm to construct the FG.6.3 Procedure ugment-g (graph G, graph G + ) { G + =G; For all node G +, { and for all nodes c i { { If there is a path from to c i then dd an edge from to ; Repeat { For all node G +, { and for all nodes c i { If there is a path from to c i then reate a connector node to group node and nodes {-{c i add an edge from to ; Until no more connector node can be created; Figure.: lgorithm for the ugmentation Process of F Graph G
13 .6.4 Procedure Reduce-G (graph G +, graph G ) { G =G + ; For each connector node G { If ( { =) then { elete node from G ; ssign all edges of to c {; For each connector node G { If the node c { has no edges except the connecting edge then elete node c from G ; lse elete the connecting edge between c and ; For all node which has a direct edge to in G { elete the edge from to the path to c i {; For all ycle K G { Remove all redundant edges from K;/Removal does not break the cycle/ While (( node G ) N (in-degree()>0 N out- degree()=0)) elete node from G ; For all ycle K G { If (in-degree(k)>0 N out- degree(k)=0) then elete cycle K from G ; Figure.: lgorithm for Reduction Process of the ugmented FG G to G.7. xplanatory xamples..7. xample: Problem: Find the candidate keys of the relation schema R= (,,, G, H, I) with the set of functional dependencies F= {,, G H, G I, H
14 Solution: From the problem statement it is found that, the FG G has 7 vertices,,, G, H, I and G as shown in fig..3. From fig..3 it is found that the candidate node for R= (,,, G, H, I) with the set of functional dependencies F= {,, G H, G I, H is the connector node. Therefore the candidate key of R is { = (G). I G G H (G) (G + ) I H G H I G I H (G ).7. xample: Problem: Find the candidate keys of the relation scheme R= (,,,,, F, G) with the set of functional dependencies F= {,,, F, F G, G Solution: Figure.3: Finding candidate nodes for R= (,,, G, H, I) with the set of functional dependencies F= {,, G H, G I, H From the problem statement, the FG G with 3 vertices,,, G,, F, G and,,,,f,g, as shown in fig..4 is obtained. There are following six connector nodes in the FG: ={, ={, 3={, 4={, 5={F, 6={G. For node : Since so is removed from.
15 For node 3: Since so is removed from 3. For node : Since and so an edge from to node is added. For node 4, the connector node 7= { and 8= { are added to the graph. For node 6, the node 9= {G is added to the graph G F G F (G) (G ) F G 6 6 Reduction (Node eletion) Reduction (ycle eletion) Graph G ) andidate Graph G Figure.4: Finding the candidate keys of the relation scheme R= (,,,,, F, G) with the set of Fs F= {,,, F, F G, G
16 y doing so, the augmented graph G is obtained. fter the reduction process the andidate graph G is obtained from which it is decided that the relation schema R=(,,,,,F,G) with the set of Fs F={,,,, F,F G,G has four candidate keys- G,,G and..8 ONLUSION In this chapter, a simple graph based method to find candidate keys of a relation scheme is described. This method takes an FG, drawn based on the set of Fs available in a relational scheme, as an input and using five very simple graph transformations the input FG is converted into a candidate graph (Transformed FG). This candidate graph gives all the candidate keys of the relation scheme. This approach does not require computation of F, F c and, the closure, canonical cover of F and closure of an attribute set. This is a purely graph based approach. This approach can also be used to find the candidate factors in the problem areas like medical diagnosis, social problems where there are many factors with cause-effect dependencies among them.
TCOM 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 informationDesign and Analysis of Algorithms
S 101, Winter 2018 esign and nalysis of lgorithms Lecture 3: onnected omponents lass URL: http://vlsicad.ucsd.edu/courses/cse101-w18/ nd of Lecture 2: s, Topological Order irected cyclic raph.g., Vertices
More informationThese definitions cover some basic terms and concepts of graph theory and how they have been implemented as C++ classes.
hapter 5. raph Theory *raph Theory, *Mathematics raph theory is an area of mathematics which has been incorporated into IS to solve some specific problems in oolean operations and sweeping. It may be also
More informationSpanning Trees. CSE373: Data Structures & Algorithms Lecture 17: Minimum Spanning Trees. Motivation. Observations. Spanning tree via DFS
Spanning Trees S: ata Structures & lgorithms Lecture : Minimum Spanning Trees simple problem: iven a connected undirected graph =(V,), find a minimal subset of edges such that is still connected graph
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 informationCS535 Big Data Fall 2017 Colorado State University 9/5/2017. Week 3 - A. FAQs. This material is built based on,
S535 ig ata Fall 217 olorado State University 9/5/217 Week 3-9/5/217 S535 ig ata - Fall 217 Week 3--1 S535 IG T FQs Programming ssignment 1 We will discuss link analysis in week3 Installation/configuration
More informationEulerian Cycle (2A) Young Won Lim 5/11/18
ulerian ycle (2) opyright (c) 2015 2018 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the NU ree ocumentation License, Version 1.2 or any later
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 informationLecture 22 Tuesday, April 10
CIS 160 - Spring 2018 (instructor Val Tannen) Lecture 22 Tuesday, April 10 GRAPH THEORY Directed Graphs Directed graphs (a.k.a. digraphs) are an important mathematical modeling tool in Computer Science,
More informationModule 11. Directed Graphs. Contents
Module 11 Directed Graphs Contents 11.1 Basic concepts......................... 256 Underlying graph of a digraph................ 257 Out-degrees and in-degrees.................. 258 Isomorphism..........................
More informationCS 5114: Theory of Algorithms. Graph Algorithms. A Tree Proof. Graph Traversals. Clifford A. Shaffer. Spring 2014
epartment of omputer Science Virginia Tech lacksburg, Virginia opyright c 04 by lifford. Shaffer : Theory of lgorithms Title page : Theory of lgorithms lifford. Shaffer Spring 04 lifford. Shaffer epartment
More informationDigraphs ( 12.4) Directed Graphs. Digraph Application. Digraph Properties. A digraph is a graph whose edges are all directed.
igraphs ( 12.4) irected Graphs OR OS digraph is a graph whose edges are all directed Short for directed graph pplications one- way streets flights task scheduling irected Graphs 1 irected Graphs 2 igraph
More informationChapter 9: Elementary Graph Algorithms Basic Graph Concepts
hapter 9: Elementary Graph lgorithms asic Graph oncepts msc 250 Intro to lgorithms graph is a mathematical object that is used to model different situations objects and processes: Linked list Tree (partial
More informationNetwork Coding-Based Protection of Many-to-One Wireless Flows
Network oding-ased Protection of Many-to-One Wireless Flows Osameh M. l-kofahi hmed. Kamal epartment of lectrical and omputer ngineering, Iowa State University e-mail:{osameh,kamal}@iastate.edu bstract
More informationCS435 Introduction to Big Data FALL 2018 Colorado State University. 9/24/2018 Week 6-A Sangmi Lee Pallickara. Topics. This material is built based on,
FLL 218 olorado State University 9/24/218 Week 6-9/24/218 S435 Introduction to ig ata - FLL 218 W6... PRT 1. LRGE SLE T NLYTIS WE-SLE LINK N SOIL NETWORK NLYSIS omputer Science, olorado State University
More informationWEEK 1 CLASS NOTES AARON G. CASS
WEEK 1 LSS NOTES RON G. SS Sc 250, Spring 2009 aron G. ass epartment of omputer Science Union ollege ELERITY PROLEM celebrity is a person known by all, but who knows nobody. In the celebrity problem, we
More informationCS 5114: Theory of Algorithms. Graph Algorithms. A Tree Proof. Graph Traversals. Clifford A. Shaffer. Spring 2014
epartment of omputer Science Virginia Tech lacksburg, Virginia opyright c 04 by lifford. Shaffer : Theory of lgorithms Title page : Theory of lgorithms lifford. Shaffer Spring 04 lifford. Shaffer epartment
More informationBasic Graph Theory with Applications to Economics
Basic Graph Theory with Applications to Economics Debasis Mishra February, 0 What is a Graph? Let N = {,..., n} be a finite set. Let E be a collection of ordered or unordered pairs of distinct elements
More informationAlgorithms, Games, and Networks February 21, Lecture 12
Algorithms, Games, and Networks February, 03 Lecturer: Ariel Procaccia Lecture Scribe: Sercan Yıldız Overview In this lecture, we introduce the axiomatic approach to social choice theory. In particular,
More informationIntroduction III. Graphs. Motivations I. Introduction IV
Introduction I Graphs Computer Science & Engineering 235: Discrete Mathematics Christopher M. Bourke cbourke@cse.unl.edu Graph theory was introduced in the 18th century by Leonhard Euler via the Königsberg
More informationNote. Out of town Thursday afternoon. Willing to meet before 1pm, me if you want to meet then so I know to be in my office
raphs and Trees Note Out of town Thursday afternoon Willing to meet before pm, email me if you want to meet then so I know to be in my office few extra remarks about recursion If you can write it recursively
More informationSpanning Tree. Lecture19: Graph III. Minimum Spanning Tree (MSP)
Spanning Tree (015) Lecture1: Graph III ohyung Han S, POSTH bhhan@postech.ac.kr efinition and property Subgraph that contains all vertices of the original graph and is a tree Often, a graph has many different
More informationData Structures Lecture 14
Fall 2018 Fang Yu Software Security Lab. ept. Management Information Systems, National hengchi University ata Structures Lecture 14 Graphs efinition, Implementation and Traversal Graphs Formally speaking,
More informationTriple Domination Number and it s Chromatic Number of Graphs
Triple Domination Number and it s Chromatic Number of Graphs A.Nellai Murugan 1 Assoc. Prof. of Mathematics, V.O.Chidambaram, College, Thoothukudi-628 008, Tamilnadu, India anellai.vocc@gmail.com G.Victor
More informationDM545 Linear and Integer Programming. Lecture 2. The Simplex Method. Marco Chiarandini
DM545 Linear and Integer Programming Lecture 2 The Marco Chiarandini Department of Mathematics & Computer Science University of Southern Denmark Outline 1. 2. 3. 4. Standard Form Basic Feasible Solutions
More informationEulerian Cycle (2A) Young Won Lim 5/25/18
ulerian ycle (2) opyright (c) 2015 2018 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU ree ocumentation License, Version 1.2 or any later
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 informationStudying Graph Connectivity
Studying Graph Connectivity Freeman Yufei Huang July 1, 2002 Submitted for CISC-871 Instructor: Dr. Robin Dawes Studying Graph Connectivity Freeman Yufei Huang Submitted July 1, 2002 for CISC-871 In some
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 informationLecture 5: Graphs. Rajat Mittal. IIT Kanpur
Lecture : Graphs Rajat Mittal IIT Kanpur Combinatorial graphs provide a natural way to model connections between different objects. They are very useful in depicting communication networks, social networks
More informationReading. Graph Terminology. Graphs. What are graphs? Varieties. Motivation for Graphs. Reading. CSE 373 Data Structures. Graphs are composed of.
Reading Graph Reading Goodrich and Tamassia, hapter 1 S 7 ata Structures What are graphs? Graphs Yes, this is a graph. Graphs are composed of Nodes (vertices) dges (arcs) node ut we are interested in a
More informationTopological Sort. CSE 373 Data Structures Lecture 19
Topological Sort S 373 ata Structures Lecture 19 Readings and References Reading Section 9.2 Some slides based on: S 326 by S. Wolfman, 2000 11/27/02 Topological Sort - Lecture 19 2 Topological Sort 142
More information3.1 Basic Definitions and Applications
Graphs hapter hapter Graphs. Basic efinitions and Applications Graph. G = (V, ) n V = nodes. n = edges between pairs of nodes. n aptures pairwise relationship between objects: Undirected graph represents
More informationHybrid Connection Simulation Using Dynamic Nodal Numbering Algorithm
merican Journal of pplied Sciences 7 (8): 1174-1181, 2010 ISSN 1546-9239 2010 Science Publications Hybrid onnection Simulation Using ynamic Nodal Numbering lgorithm 1 longkorn Lamom, 2 Thaksin Thepchatri
More informationMT365 Examination 2017 Part 1 Solutions Part 1
MT xamination 0 Part Solutions Part Q. G (a) Number of vertices in G =. Number of edges in G = (i) The graph G is simple no loops or multiple edges (ii) The graph G is not regular it has vertices of deg.,
More informationWhat are graphs? (Take 1)
Lecture 22: Let s Get Graphic Graph lgorithms Today s genda: What is a graph? Some graphs that you already know efinitions and Properties Implementing Graphs Topological Sort overed in hapter 9 of the
More informationGRAPH THEORY. What are graphs? Why graphs? Graphs are usually used to represent different elements that are somehow related to each other.
GRPH THEORY Hadrian ng, Kyle See, March 2017 What are graphs? graph G is a pair G = (V, E) where V is a nonempty set of vertices and E is a set of edges e such that e = {a, b where a and b are vertices.
More information1 Random Walks on Graphs
Lecture 7 Com S 633: Randomness in Computation Scribe: Ankit Agrawal In the last lecture, we looked at random walks on line and used them to devise randomized algorithms for 2-SAT and 3-SAT For 2-SAT we
More informationAlternate Algorithm for DSM Partitioning
lternate lgorithm for SM Partitioning Power of djacency Matrix pproach Using the power of the adjacency matrix approach, a binary SM is raised to its n th power to indicate which tasks can be traced back
More informationA Geometric Approach to the Bisection Method
Geometric pproach to the isection Method laudio Gutierrez 1, Flavio Gutierrez 2, and Maria-ecilia Rivara 1 1 epartment of omputer Science, Universidad de hile lanco Encalada 2120, Santiago, hile {cgutierr,mcrivara}@dcc.uchile.cl
More informationDeformable Polygon Representation and Near-Mincuts
BOLYAI SOCIETY Building Bridges MATHEMATICAL STUDIES, 19 pp. 1 33. Deformable Polygon Representation and Near-Mincuts András A. Benczúr and Michel X. Goemans We derive a necessary and sufficient condition
More informationLesson 22: Basic Graph Concepts
Lesson 22: asic Graph oncepts msc 175 iscrete Mathematics 1. Introduction graph is a mathematical object that is used to model different relations between objects and processes: Linked list Flowchart of
More informationReducing Clocks in Timed Automata while Preserving Bisimulation
Reducing Clocks in Timed Automata while Preserving Bisimulation Shibashis Guha Chinmay Narayan S. Arun-Kumar Indian Institute of Technology Delhi {shibashis, chinmay, sak}@cse.iitd.ac.in arxiv:1404.6613v2
More informationGraphs. Pseudograph: multiple edges and loops allowed
Graphs G = (V, E) V - set of vertices, E - set of edges Undirected graphs Simple graph: V - nonempty set of vertices, E - set of unordered pairs of distinct vertices (no multiple edges or loops) Multigraph:
More informationCSE 373: Data Structures and Algorithms. Graph Traversals. Autumn Shrirang (Shri) Mare
SE 373: ata Structures and lgorithms Graph Traversals utumn 2018 Shrirang (Shri) Mare shri@cs.washington.edu Thanks to Kasey hampion, en Jones, dam lank, Michael Lee, Evan Mcarty, Robbie Weber, Whitaker
More informationCSE 417 Network Flows (pt 3) Modeling with Min Cuts
CSE 417 Network Flows (pt 3) Modeling with Min Cuts Reminders > HW6 is due on Friday start early bug fixed on line 33 of OptimalLineup.java: > change true to false Review of last two lectures > Defined
More informationAlgebraic Topology: A brief introduction
Algebraic Topology: A brief introduction Harish Chintakunta This chapter is intended to serve as a brief, and far from comprehensive, introduction to Algebraic Topology to help the reading flow of this
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 informationarxiv: v2 [cs.ds] 25 Jan 2017
d-hop Dominating Set for Directed Graph with in-degree Bounded by One arxiv:1404.6890v2 [cs.ds] 25 Jan 2017 Joydeep Banerjee, Arun Das, and Arunabha Sen School of Computing, Informatics and Decision System
More informationThe Edge Slide Graph of the 3-cube
Rose-Hulman Undergraduate Mathematics Journal Volume 12 Issue 2 Article 6 The Edge Slide Graph of the 3-cube Lyndal Henden Massey University, Palmerston North, New Zealand, lyndal_henden@hotmail.com Follow
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 informationLecture 4 Greedy algorithms
dvanced lgorithms loriano Zini ree University of ozen-olzano aculty of omputer Science cademic Year 203-20 Lecture Greedy algorithms hess vs Scrabble In chess the player must think ahead winning strategy
More informationGraph Algorithms. Tours in Graphs. Graph Algorithms
Graph Algorithms Tours in Graphs Graph Algorithms Special Paths and Cycles in Graphs Euler Path: A path that traverses all the edges of the graph exactly once. Euler Cycle: A cycle that traverses all the
More informationCISC 320 Introduction to Algorithms Fall Lecture 15 Depth First Search
IS 320 Introduction to lgorithms all 2014 Lecture 15 epth irst Search 1 Traversing raphs Systematic search of every edge and vertex of graph (directed or undirected) fficiency: each edge is visited no
More informationChapter 4. square sum graphs. 4.1 Introduction
Chapter 4 square sum graphs In this Chapter we introduce a new type of labeling of graphs which is closely related to the Diophantine Equation x 2 + y 2 = n and report results of our preliminary investigations
More informationStar Decompositions of the Complete Split Graph
University of Dayton ecommons Honors Theses University Honors Program 4-016 Star Decompositions of the Complete Split Graph Adam C. Volk Follow this and additional works at: https://ecommons.udayton.edu/uhp_theses
More informationGraph Application in Multiprocessor Task Scheduling
Graph pplication in Multiprocessor Task Scheduling Yusuf Rahmat Pratama, 13516062 Program Studi Teknik Informatika Sekolah Teknik lektro dan Informatika Institut Teknologi andung, Jl. Ganesha 10 andung
More informationSection 8.2 Graph Terminology. Undirected Graphs. Definition: Two vertices u, v in V are adjacent or neighbors if there is an edge e between u and v.
Section 8.2 Graph Terminology Undirected Graphs Definition: Two vertices u, v in V are adjacent or neighbors if there is an edge e between u and v. The edge e connects u and v. The vertices u and v are
More informationCLASSES OF VERY STRONGLY PERFECT GRAPHS. Ganesh R. Gandal 1, R. Mary Jeya Jothi 2. 1 Department of Mathematics. Sathyabama University Chennai, INDIA
Inter national Journal of Pure and Applied Mathematics Volume 113 No. 10 2017, 334 342 ISSN: 1311-8080 (printed version); ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu ijpam.eu Abstract: CLASSES
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 informationMinimum Cost Edge Disjoint Paths
Minimum Cost Edge Disjoint Paths Theodor Mader 15.4.2008 1 Introduction Finding paths in networks and graphs constitutes an area of theoretical computer science which has been highly researched during
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 informationStrong Dominating Sets of Some Arithmetic Graphs
International Journal of Computer Applications (09 888) Volume 8 No, December 01 Strong Dominating Sets of Some Arithmetic Graphs MManjuri Dept of Applied Mathematics, SPWomen s University, Tirupati-10,
More informationGraph Theory S 1 I 2 I 1 S 2 I 1 I 2
Graph Theory S I I S S I I S Graphs Definition A graph G is a pair consisting of a vertex set V (G), and an edge set E(G) ( ) V (G). x and y are the endpoints of edge e = {x, y}. They are called adjacent
More informationAlgorithm That Mimics Human Perceptual Grouping of Dot Patterns
Algorithm That Mimics Human Perceptual Grouping of Dot Patterns G. Papari and N. Petkov Institute of Mathematics and Computing Science, University of Groningen, P.O.Box 800, 9700 AV Groningen, The Netherlands
More informationCHAPTER 14 GRAPH ALGORITHMS ORD SFO LAX DFW
SO OR HPTR 1 GRPH LGORITHMS LX W KNOWLGMNT: THS SLIS R PT ROM SLIS PROVI WITH T STRUTURS N LGORITHMS IN JV, GOORIH, TMSSI N GOLWSSR (WILY 16) 6 OS MINIMUM SPNNING TRS SO 16 PV OR 1 1 16 61 JK 1 1 11 WI
More informationCharacterizing Graphs (3) Characterizing Graphs (1) Characterizing Graphs (2) Characterizing Graphs (4)
S-72.2420/T-79.5203 Basic Concepts 1 S-72.2420/T-79.5203 Basic Concepts 3 Characterizing Graphs (1) Characterizing Graphs (3) Characterizing a class G by a condition P means proving the equivalence G G
More informationL10 Graphs. Alice E. Fischer. April Alice E. Fischer L10 Graphs... 1/37 April / 37
L10 Graphs lice. Fischer pril 2016 lice. Fischer L10 Graphs... 1/37 pril 2016 1 / 37 Outline 1 Graphs efinition Graph pplications Graph Representations 2 Graph Implementation 3 Graph lgorithms Sorting
More informationarxiv: v1 [math.co] 24 Aug 2009
SMOOTH FANO POLYTOPES ARISING FROM FINITE PARTIALLY ORDERED SETS arxiv:0908.3404v1 [math.co] 24 Aug 2009 TAKAYUKI HIBI AND AKIHIRO HIGASHITANI Abstract. Gorenstein Fano polytopes arising from finite partially
More informationGraphs: Connectivity. A graph. Transportation systems. Social networks
graph raphs: onnectivity ordi ortadella and ordi Petit epartment of omputer Science Source: Wikipedia The network graph formed by Wikipedia editors (edges) contributing to different Wikipedia language
More informationA GRAPH THEORETICAL APPROACH TO MONOGENIC AND STRONGLY MONOGENIC RIGHT TERNARY N-GROUPS
A GRAPH THEORETICAL APPROACH TO MONOGENIC AND STRONGLY MONOGENIC RIGHT TERNARY N-GROUPS A. UMA MAHESWARI AND C. MEERA Department of Mathematics, Quaid-E-Millath Government College for Women (Autonomous),
More informationMATH 423 Linear Algebra II Lecture 17: Reduced row echelon form (continued). Determinant of a matrix.
MATH 423 Linear Algebra II Lecture 17: Reduced row echelon form (continued). Determinant of a matrix. Row echelon form A matrix is said to be in the row echelon form if the leading entries shift to the
More informationData Organization: Creating Order Out Of Chaos
ata Organization: reating Order Out Of haos 3 Non-linear data structures 5-5 Principles of omputation, arnegie Mellon University - ORTIN Trees tree is a hierarchical (usually non-linear) data structure.
More informationCSE 373: Data Structures and Algorithms. Graphs. Autumn Shrirang (Shri) Mare
SE 373: Data Structures and lgorithms Graphs utumn 2018 Shrirang (Shri) Mare shri@cs.washington.edu Thanks to Kasey hampion, en Jones, dam lank, Michael Lee, Evan Mcarty, Robbie Weber, Whitaker rand, Zora
More informationCHAPTER 2. Graphs. 1. Introduction to Graphs and Graph Isomorphism
CHAPTER 2 Graphs 1. Introduction to Graphs and Graph Isomorphism 1.1. The Graph Menagerie. Definition 1.1.1. A simple graph G = (V, E) consists of a set V of vertices and a set E of edges, represented
More informationStructured System Theory
Appendix C Structured System Theory Linear systems are often studied from an algebraic perspective, based on the rank of certain matrices. While such tests are easy to derive from the mathematical model,
More informationGraphs and Network Flows IE411. Lecture 21. Dr. Ted Ralphs
Graphs and Network Flows IE411 Lecture 21 Dr. Ted Ralphs IE411 Lecture 21 1 Combinatorial Optimization and Network Flows In general, most combinatorial optimization and integer programming problems are
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 information2.8. Connectedness A topological space X is said to be disconnected if X is the disjoint union of two non-empty open subsets. The space X is said to
2.8. Connectedness A topological space X is said to be disconnected if X is the disjoint union of two non-empty open subsets. The space X is said to be connected if it is not disconnected. A subset of
More informationReading. Graph Introduction. What are graphs? Graphs. Motivation for Graphs. Varieties. Reading. CSE 373 Data Structures Lecture 18
Reading Graph Introduction Reading Section 9.1 S 373 ata Structures Lecture 18 11/25/02 Graph Introduction - Lecture 18 2 What are graphs? Yes, this is a graph. Graphs Graphs are composed of Nodes (vertices)
More informationSome Properties of Glue Graph
Annals of Pure and Applied Mathematics Vol. 6, No. 1, 2014, 98-103 ISSN: 2279-087X (P), 2279-0888(online) Published on 23 May 2014 www.researchmathsci.org Annals of V.S.Shigehalli 1 and G.V.Uppin 2 1 Department
More informationarxiv: v1 [cs.dm] 13 Apr 2012
A Kuratowski-Type Theorem for Planarity of Partially Embedded Graphs Vít Jelínek, Jan Kratochvíl, Ignaz Rutter arxiv:1204.2915v1 [cs.dm] 13 Apr 2012 Abstract A partially embedded graph (or Peg) is a triple
More informationAVERAGE D-DISTANCE BETWEEN VERTICES OF A GRAPH
italian journal of pure and applied mathematics n. 33 2014 (293 298) 293 AVERAGE D-DISTANCE BETWEEN VERTICES OF A GRAPH D. Reddy Babu Department of Mathematics Koneru Lakshmaiah Education Foundation (K.L.
More informationMasakuni TAKI. Application of Transitive Graph for Education Support System 69
Application of Transitive Graph for Education Support System 69 Masakuni TAKI This paper reports an education support system to take required credits from entrance to graduation in a college. This system
More informationCombining Tree Partitioning, Precedence, and Incomparability Constraints
Combining Tree Partitioning, Precedence, and Incomparability Constraints Nicolas Beldiceanu 1, Pierre Flener 2, and Xavier Lorca 1 1 École des Mines de Nantes, LINA FREE CNRS 2729 FR 44307 Nantes Cedex
More informationQuery Optimization of Distributed Pattern Matching
Query Optimization of istributed Pattern Matching Jiewen Huang, Kartik Venkatraman, aniel J. badi Yale University jiewen.huang@yale.edu, kartik.venkatraman@yale.edu, dna@cs.yale.edu bstract Greedy algorithms
More informationEdge Graceful Labeling of Some Trees
Global Journal of Mathematical Sciences: Theory and Practical. olume, Number (0), pp. - International Research Publication House http://www.irphouse.com Edge Graceful Labeling of Some Trees B. Gayathri
More informationGraphs. Introduction To Graphs: Exercises. Definitions:
Graphs Eng.Jehad Aldahdooh Introduction To Graphs: Definitions: A graph G = (V, E) consists of V, a nonempty set of vertices (or nodes) and E, a set of edges. Each edge has either one or two vertices associated
More information1. Lecture notes on bipartite matching
Massachusetts Institute of Technology 18.453: Combinatorial Optimization Michel X. Goemans February 5, 2017 1. Lecture notes on bipartite matching Matching problems are among the fundamental problems in
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 informationConstraint Programming. Global Constraints. Amira Zaki Prof. Dr. Thom Frühwirth. University of Ulm WS 2012/2013
Global Constraints Amira Zaki Prof. Dr. Thom Frühwirth University of Ulm WS 2012/2013 Amira Zaki & Thom Frühwirth University of Ulm Page 1 WS 2012/2013 Overview Classes of Constraints Global Constraints
More information4 Integer Linear Programming (ILP)
TDA6/DIT37 DISCRETE OPTIMIZATION 17 PERIOD 3 WEEK III 4 Integer Linear Programg (ILP) 14 An integer linear program, ILP for short, has the same form as a linear program (LP). The only difference is that
More informationConsistency and Set Intersection
Consistency and Set Intersection Yuanlin Zhang and Roland H.C. Yap National University of Singapore 3 Science Drive 2, Singapore {zhangyl,ryap}@comp.nus.edu.sg Abstract We propose a new framework to study
More informationMathematical and Algorithmic Foundations Linear Programming and Matchings
Adavnced Algorithms Lectures Mathematical and Algorithmic Foundations Linear Programming and Matchings Paul G. Spirakis Department of Computer Science University of Patras and Liverpool Paul G. Spirakis
More informationOutline. Introduction. Representations of Graphs Graph Traversals. Applications. Definitions and Basic Terminologies
Graph Chapter 9 Outline Introduction Definitions and Basic Terminologies Representations of Graphs Graph Traversals Breadth first traversal Depth first traversal Applications Single source shortest path
More informationMinimum Spanning Trees. COMPSCI 355 Fall 2016
Minimum Spanning Trees COMPSCI all 06 Spanning Tree Spanning Tree Spanning Tree Algorithm A Add any edge that can be added without creating a cycle. Repeat until the edges form a spanning tree. Algorithm
More informationComputational problems. Lecture 2: Combinatorial search and optimisation problems. Computational problems. Examples. Example
Lecture 2: Combinatorial search and optimisation problems Different types of computational problems Examples of computational problems Relationships between problems Computational properties of different
More informationReachability in K 3,3 -free and K 5 -free Graphs is in Unambiguous Logspace
CHICAGO JOURNAL OF THEORETICAL COMPUTER SCIENCE 2014, Article 2, pages 1 29 http://cjtcs.cs.uchicago.edu/ Reachability in K 3,3 -free and K 5 -free Graphs is in Unambiguous Logspace Thomas Thierauf Fabian
More informationK 4,4 e Has No Finite Planar Cover
K 4,4 e Has No Finite Planar Cover Petr Hliněný Dept. of Applied Mathematics, Charles University, Malostr. nám. 25, 118 00 Praha 1, Czech republic (E-mail: hlineny@kam.ms.mff.cuni.cz) February 9, 2005
More informationA METHODOLOGY FOR ANALYSIS OF TOPOLOGICAL CHARATERISTICS OF PLANETARY GEAR TRAINS
A METHODOLOGY FOR ANALYSIS OF TOPOLOGICAL CHARATERISTICS OF PLANETARY GEAR TRAINS Dr. S.R.madan, Sajid Quresh, Mustaq Ptel Mahakal Institute of Technology and Management, UJJIN, (M.P.), India. ABSTRACT:-
More information