Counting the Number of Minimum Roman Dominating Functions of a Graph
|
|
- Lorin Byrd
- 5 years ago
- Views:
Transcription
1 Coutig the Number of Miimum Roma Domiatig Fuctios of a Graph SHI ZHENG ad KOH KHEE MENG, Natioal Uiversity of Sigapore We provide two algorithms coutig the umber of miimum Roma domiatig fuctios of a graph o vertices i ( ) time ad polyomial space. We also show that the time complexity ca be reduced to ( ) if expoetial space is used. Our result is obtaied by trasformig the Roma domiatio problem ito other combiatorial problems o graphs for which exact algorithms already exist. Categories ad Subject Descriptors: G.2.2 [Discrete Mathematics]: Graph Theory Graph Algorithms Geeral Terms: Algorithms, Theory Additioal Key Words ad Phrases: Roma domiatio, exact algorithm, set cover, partial domiatig set, red-blue domiatig set 1. INTRODUCTION I algorithmic graph theory, exact expoetial-time algorithms are those usig expoetial executive time to give exact solutios to the problem. This field has grow tremedously recetly ad may ew techiques have bee developed, for istace, measure ad coquer by Fomi et al. [2005] which is a techique for estimatig bouds o the ruig time. There are also may kow results itroduced to the field, for istace, iclusio/exclusio [Bjӧrklud ad Husfeldt. 2006] ad dyamic programmig o graph decompositios [Fomi ad Stepaov. 2007; va Rooij et al. 2009]. Exact expoetial-time algorithms o may problems i domiatio ad its variats have bee desiged ad the bouds o ruig time cotiue to be improved by ewly developed or itroduced techiques. Roma domiatio is a variat of domiatio raised by Cockaye et al. [2004] i which the algorithmic ad complexity properties of Roma domiatio was metioed as a ope problem. May theoretical results i Roma domiatio have bee foud ad there exist polyomial time algorithms for computig the Roma domiatio umbers of some special classes of graphs [Cockaye et al. 2004; Liedloff et al. 2005]. However, the Roma domiatio problem for geeral graphs is NPcomplete as stated i Cockaye et al. [2004], ad thus we oly expect to costruct exact expoetial time algorithm o the Roma domiatio problem. Util ow, o exact algorithm has bee costructed o the Roma domiatio problem, ad the (1) of the trivial algorithm by listig ad best result o time complexity is (3 ) checkig. Our Results. I this paper, we are goig to itroduce exact expoetial-time algorithms coutig the umber of miimum Roma domiatig fuctios by kow results i exact algorithms o domiatio ad its variats. Two algorithms usig ( ) time ad polyomial space will be itroduced. It is oted that the approaches to costruct these two algorithms are differet. The first algorithm is ispired by usig a weight set cover istace to model the Roma domiatio problem, while the secod is costructed by relatig Roma domiatio to partial domiatio. I additio, a algorithm usig ( ) time ad expoetial space ca be derived from the secod algorithm. This paper falls ito three sectios. I Sectio 2, we provide some basic defiitios ad results. I Sectio 3, the algorithms coutig the umber of miimum Roma domiatig fuctios are give. 1
2 2. DEFINITIONS AND BASIC RESULTS 2.1 Domiatio i graphs Let G ( V, E) be a simple graph with vertex set V ad edge set E. The ope eighborhood of a vertex v, deoted as Nv, () is the set of vertices i G that are adjacet to v, ad N[ v] { v} N( v) is the closed eighborhood of v. A subset D V is called a domiatig set of G if for every v V, v either belogs to D or is adjacet to some vertex i D. A domiatig set is said to be miimal if o proper subset of it is a domiatig set of G. The miimum cardiality of a domiatig set is called the domiatio umber of G, deoted as ( G), ad ay domiatig set of cardiality ( G) is called a miimum domiatig set or -set. If there is a weight fuctio w: V, the D V is called a miimum weight domiatig set if D is a domiatig set of the miimum weight. I the case w: V {1}, the miimum weight domiatig set problem is reduced to the miimum domiatig set problem. A subset D V is called a partial domiatig set if there are at most l vertices that are either i D or adjacet to ay vertex i D. I other words, D domiates at least l vertices. I a bipartite graph G ( R B, E), D R is called a red-blue domiatig set if B N( D) ad D is said to be miimum if it has the miimum cardiality. For a fuctio f : V {0,1, 2}, f is called a Roma domiatig fuctio, or abbreviated as RDF, if for every u V0, V2 N( u ) is ot empty. For a subset V ' V, defie f ( V ') v V' f ( v) ad the weight of f is f ( V ) v V f ( v). The miimum weight of a RDF of G is the Roma domiatio umber of G, deoted as R ( G), ad a RDF f is called a miimum Roma domiatig fuctio or R -fuctio if w( f ) R ( G). The triple { V0, V1, V 2} is a vertex partitio, where Vi { v f ( v) i} for i = 0, 1, 2, ad sice there is a 1-1 correspodece betwee fuctios f : V {0,1, 2} ad vertex partitios { V0, V1, V 2}, we may write f { V0, V1, V2} for simplicity. 2.2 Set cover A set cover istace is defied by a uiverse ad a collectio of subsets such that R R. A set cover of a set cover istace (, ) is a sub-collectio ' such that R ' R. The cardiality of a set cover is the umber of subsets i the set cover. A set cover is said to be miimal if oe of its proper sub-collectio is a set cover. A miimum set cover is the oe of the miimum cardiality. If there is a weight fuctio w :, the ' is called a miimum weight set cover if ' is a set cover of the miimum weight. A set cover istace (, ) ca also be formulated as the red-blue domiatig set problem o G ( R B, E) by takig R { S S }, B { e e } ad ( e, S) E if ad oly if e S for ay e ad S. G ( R B, E) is called the icidece graph of the set cover istace (, ). Sometimes the red-blue domiatig set problem is cosidered istead of the set cover problem. For a graph G ( V, E), if we take V ad { N[ v] v V}, the D V is a miimal or miimum domiatig set if ad oly if ' { N[ v] v D} is a miimal or miimum, respectively, set cover of the set cover istace (, ). Hece (, ) defied above is ofte used as the set cover modellig of the domiatig set problem o G. Almost all expoetial-time exact algorithms after Gradoi [2006] apply algorithms desiged o the set cover problems o the set cover modellig of the domiatig set problem. 2
3 3. ALGORITHMS I this sectio, we are goig to itroduce two exact algorithms o Roma domiatio. Both of the algorithms cout the umber of R -fuctios of a graph G of vertices usig ( ) time ad polyomial space, however they are costructed by differet approaches. The first algorithm is desiged by usig a weight set cover modellig of the Roma domiatio problem ad the secod is desiged by relatig the Roma domiatio problem to the partial domiatig set problem i graphs. There exist exact algorithms o both weight set cover problems ad partial domiatig set problems ad therefore we will directly iclude them as subrouties i our algorithms o Roma domiatio. I additio, by the secod approach, we ca also itroduce a algorithm usig ( ) time ad expoetial space to cout the umber of R -fuctios of a graph G. 3.1 A algorithm coutig the umber of R -fuctios For ay simple graph G ( V, E) o vertices, we itroduce a weight set cover istace ( R, R ), here R V ad R { v v V} { N[ v] v V} with the weight fuctio w({ v}) 1 ad wnv ( [ ]) 2 for each v V. We otice that for ay RDF f { V0, V1, V2} of G, { v v V1} { N[ v] v V2} is a set cover of ( R, R ). Ad for a set cover { v v V1} { N[ v] v V2} such that V1 V 2 is empty, the fuctio f { V \{ V1 V2}, V1, V2} is a RDF. It is ot hard to see that for ay miimum weight set cover { v v V1} { N[ v] v V2}, V1 V2 ; otherwise, if v V1 V2, the \ { v } is a set cover of weight smaller tha the weight of, which is a cotradictio. Hece, solvig the Roma domiatio problem o G is equivalet to solvig the miimum weight set cover problem o ( R, R ) as defied above. Va Rooij [2010] showed that the miimum weight domiatig set problem ca be solved i ( ) time ad polyomial space if the set of possible weight sums is polyomially bouded. I his work, a algorithm listig the umber of set covers of each weight was desiged ad applied o a weight set cover istace reduced from the miimum weight domiatig set problem. Here we ca adopt this algorithm to solve our miimum weight set cover problem o ( R, R ) sice the possible weight of a subset is either 1 or 2. ALGORITHM 1. A Algorithm Computig the Number of R -fuctios Iput: A simple graph G ( V, E) Output: The umber of R -fuctios(# R -fuctios) 1. Geerate a weight set cover istace ( R, R ) with weight fuctio w : R V, R { v v V} { N[ v] v V} ad w({ v}) 1 ad wnv ( [ ]) 2 for each v V 2. Geerate the icidece graph I( R R, E ) of ( R, R ) : ( e, S) E if ad oly if e S for ay e R ad S R 3. Compute the umber of set covers of each possible weight: CWSC ( I ( R R, E), ) 4. Retur the umber of R -fuctios: # R -fuctios is the umber of set covers of the miimum weight SUBROUTINE CWSC. A Algorithm Coutig the Number of Set Covers of Each Weight Iput: The icidece graph I(, E) ad a set of aotated vertices A Output: A list cotaiig the umber of set covers of (, ) of each weight 3
4 Table I. The weights vi () ad wi () i complexity aalysis of Algorithm 1 i >6 vi () wi () Source: [Va Rooij 2010] The subroutie CWSC will call itself recursively ad the iput aotated vertices A is set to be empty iitially. For more details of CWSC see va Rooij [2010]. THEOREM 3.1. The Roma domiatio problem ca be solved i ( ) ad polyomial space. time PROOF. We cosider usig Algorithm 1 to solve the Roma domiatio problem. The mai part of Algorithm 1 is obviously i lie 3 which is applyig CWSC o the weight set cover istace ( R, R ), ad the time complexity of Algorithm 1 ca be bouded by that of CWSC ( I( R R, E), ). By usig measure ad coquer techique, va Rooij [2010] showed that the time complexity of CWSC ca be bouded by k( ) ( ), here k ( ) v ( d ( e )) w ( d ( S )) e ( )\ A ( )\ A S dx ( u) is the degree of u X i the iduced graph GX [ ] ad vi () ad wi () are weights set as i Table I. Hece, for the set cover istace ( R, R ), k( ) ( w(1) w( 6) v( 6)) R ad therefore the time complexity of Algorithm 1 ca be bouded from above by ( ) ( ). Actually this is also the complexity of applyig CWSC o the set cover modellig of the miimum domiatig set problem sice vertices represetig subsets of degree 1 i G[( ) \ A ] do ot cotribute to the complexity. However, there is a faster versio of CWSC that uses expoetial space i which the vertices represetig subsets of degree 1 will cotribute to the complexity ad the cost of applyig it o ( R, R ) will be expoetial space ad greater tha ( ) time. Hece we are ot goig to itroduce expoetial space exact algorithms by usig the weight set cover modellig here. 3.2 Aother algorithm coutig the umber of R -fuctios Give a simple graph G ( V, E) ad a R -fuctio f { V0, V1, V2} of G, for every vertex u V0, u is adjacet to at least oe vertex v V2. Moreover, there is o edge joiig V1 ad V 2. Hece, V 2 is a partial domiatig set that domiates exactly V 1 vertices ad the umber of RDF such that V1 k ad V2 j ad there is o edge joiig V1 ad V2 is the umber of partial domiatig sets of cardiality j that domiates exactly k vertices. 4
5 Recall that for a graph G ( V, E), the set cover modellig of the miimum domiatig set problem o G is a set cover istace (, ), where V ad { N[ v] v V} ad the icidece graph I(, E ) of (, ) is a bipartite graph such that ( e, S) E if ad oly if e S for ay e ad S. The D is a partial domiatig set of cardiality j that domiates exactly k vertices of G if ad oly if D is a partial red-blue domiatig set of j vertices i that domiates exactly k vertices i of the icidece graph I. Nederlof ad va Rooij [2010] showed that the partial domiatig set problem ca be solved i ( ) time ad polyomial space by a algorithm that computes a matrix P cotaiig the umber of partial red-blue domiatig sets of j red vertices domiatig exactly l blue vertices for each give 0 j R ad 0 l B for ay bipartite graph G ( R B, E). Here we will iclude this algorithm as a subroutie. ALGORITHM 2. A Algorithm Computig the Number of R -fuctios Iput: A simple graph G ( V, E) Output: The umber of R -fuctios(# R -fuctios) 1. Geerate a set cover istace (, ) : V ad { N[ v] v V} 2. Geerate the icidece graph I(, E ) of (, ) : ( e, S) E if ad oly if e S for ay e ad S 3. Compute a matrix P cotaiig the umber of partial red-blue domiatig sets of cardiality j that domiates exactly l vertices: CPSC ( I(, E), ) 4. Compute a matrix A cotaiig the umber of RDF such that V1 k ad V2 j ad there is o edge joiig V1 ad V 2 : ajk p, j k 5. Compute the Roma domiatio umber: R mi {2 j k} a jk 0 6. Compute the umber of R -fuctios: # R -fuctios = 2 j k R a jk SUBROUTINE CPSC. A Algorithm Computig the Number of Partial Red-Blue Domiatig Sets Iput: A bipartite graph G ( R B, E) ad a set of aotated vertices A Output: A matrix cotaiig the umber of partial red-blue domiatig sets of cardiality j that domiates exactly l vertices for each give 0 j R ad 0 l B The subroutie CPSC is very similar to CWSC as the iputs are both a bipartite graph ad a set of aotated vertices that is empty iitially ad the outputs ca be geerated by similar rules. This similarity leads to that the complexity aalysis of CPSC is the same as that of CWSC. AN ALTERNATE PROOF FOR THEOREM 3.1. We cosider usig Algorithm 2 to solve the Roma domiatio problem. The mai part of Algorithm 2 is lie 3 which applies CPSC o the weight set cover istace (, ) ad the time complexity of Algorithm 2 ca be bouded by that of CPSC ( I(, E), ). The complexity was aalyzed to be ( ) time ad polyomial space [Nederlof ad va Rooij. 2010]. There is a expoetial-space versio of CPSC usig ( ) time solvig the partial domiatig set problem. For more details see Nederlof ad va Rooij [2010]. THEOREM 3.2. The Roma domiatio problem ca be solved i ( ) ad expoetial space. time 5
6 PROOF. We cosider substitutig CPSC i Algorithm 2 with its expoetial-space versio ad use it to solve the Roma domiatio problem. The time complexity ca be estimated i the way similar to the alterate proof for Theorem 3.1 to be ( ). REFERENCES Bjӧrklud, A. ad Husfeldt, T Iclusio--Exclusio Algorithms for Coutig Set Partitios. I Foudatios of Computer Sciece, FOCS '06. 47th Aual IEEE Symposium o, Cockaye, E.J., Dreyer, P.A., Hedetiemi, S.M. ad Hedetiemi, S.T Roma domiatio i graphs. Discrete Mathematics 278, Fomi, F., Gradoi, F. ad Kratsch, D Measure ad Coquer: Domiatio A Case Study. I Automata, Laguages ad Programmig, L. CAIRES, G. ITALIANO, L. MONTEIRO, C. PALAMIDESSI AND M. YUNG Eds. Spriger Berli Heidelberg, Fomi, F. ad Stepaov, A Coutig Miimum Weighted Domiatig Sets. I Computig ad Combiatorics, G. LIN Ed. Spriger Berli Heidelberg, Gradoi, F A ote o the complexity of miimum domiatig set. Joural of Discrete Algorithms 4, Liedloff, M., Kloks, T., Liu, J. ad Peg, S.-L Roma Domiatio over Some Graph Classes. I Graph-Theoretic Cocepts i Computer Sciece, D. KRATSCH Ed. Spriger Berli Heidelberg, Nederlof, J. ad va Rooij, J.M.M.V Iclusio/Exclusio Brachig for Partial Domiatig Set ad Set Splittig. Va Rooij, J.M Polyomial Space Algorithms for Coutig Domiatig Sets ad the Domatic Number. I Algorithms ad Complexity, T. CALAMONERI AND J. DIAZ Eds. Spriger Berli Heidelberg, Va Rooij, J.M., Bodlaeder, H. ad Rossmaith, P Dyamic Programmig o Tree Decompositios Usig Geeralised Fast Subset Covolutio. I Algorithms - ESA 2009, A. FIAT AND P. SANDERS Eds. Spriger Berli Heidelberg,
Strong Complementary Acyclic Domination of a Graph
Aals of Pure ad Applied Mathematics Vol 8, No, 04, 83-89 ISSN: 79-087X (P), 79-0888(olie) Published o 7 December 04 wwwresearchmathsciorg Aals of Strog Complemetary Acyclic Domiatio of a Graph NSaradha
More informationA study on Interior Domination in Graphs
IOSR Joural of Mathematics (IOSR-JM) e-issn: 2278-5728, p-issn: 219-765X. Volume 12, Issue 2 Ver. VI (Mar. - Apr. 2016), PP 55-59 www.iosrjourals.org A study o Iterior Domiatio i Graphs A. Ato Kisley 1,
More informationPerhaps the method will give that for every e > U f() > p - 3/+e There is o o-trivial upper boud for f() ad ot eve f() < Z - e. seems to be kow, where
ON MAXIMUM CHORDAL SUBGRAPH * Paul Erdos Mathematical Istitute of the Hugaria Academy of Scieces ad Reu Laskar Clemso Uiversity 1. Let G() deote a udirected graph, with vertices ad V(G) deote the vertex
More informationA Note on Chromatic Transversal Weak Domination in Graphs
Iteratioal Joural of Mathematics Treds ad Techology Volume 17 Number 2 Ja 2015 A Note o Chromatic Trasversal Weak Domiatio i Graphs S Balamuruga 1, P Selvalakshmi 2 ad A Arivalaga 1 Assistat Professor,
More informationCHAPTER IV: GRAPH THEORY. Section 1: Introduction to Graphs
CHAPTER IV: GRAPH THEORY Sectio : Itroductio to Graphs Sice this class is called Number-Theoretic ad Discrete Structures, it would be a crime to oly focus o umber theory regardless how woderful those topics
More informationINTERSECTION CORDIAL LABELING OF GRAPHS
INTERSECTION CORDIAL LABELING OF GRAPHS G Meea, K Nagaraja Departmet of Mathematics, PSR Egieerig College, Sivakasi- 66 4, Virudhuagar(Dist) Tamil Nadu, INDIA meeag9@yahoocoi Departmet of Mathematics,
More informationSum-connectivity indices of trees and unicyclic graphs of fixed maximum degree
1 Sum-coectivity idices of trees ad uicyclic graphs of fixed maximum degree Zhibi Du a, Bo Zhou a *, Nead Triajstić b a Departmet of Mathematics, South Chia Normal Uiversity, uagzhou 510631, Chia email:
More informationc-dominating Sets for Families of Graphs
c-domiatig Sets for Families of Graphs Kelsie Syder Mathematics Uiversity of Mary Washigto April 6, 011 1 Abstract The topic of domiatio i graphs has a rich history, begiig with chess ethusiasts i the
More informationcondition w i B i S maximum u i
ecture 10 Dyamic Programmig 10.1 Kapsack Problem November 1, 2004 ecturer: Kamal Jai Notes: Tobias Holgers We are give a set of items U = {a 1, a 2,..., a }. Each item has a weight w i Z + ad a utility
More informationPseudocode ( 1.1) Analysis of Algorithms. Primitive Operations. Pseudocode Details. Running Time ( 1.1) Estimating performance
Aalysis of Algorithms Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite amout of time. Pseudocode ( 1.1) High-level descriptio of a algorithm More structured
More informationNew Results on Energy of Graphs of Small Order
Global Joural of Pure ad Applied Mathematics. ISSN 0973-1768 Volume 13, Number 7 (2017), pp. 2837-2848 Research Idia Publicatios http://www.ripublicatio.com New Results o Eergy of Graphs of Small Order
More informationData Structures and Algorithms. Analysis of Algorithms
Data Structures ad Algorithms Aalysis of Algorithms Outlie Ruig time Pseudo-code Big-oh otatio Big-theta otatio Big-omega otatio Asymptotic algorithm aalysis Aalysis of Algorithms Iput Algorithm Output
More informationOutline and Reading. Analysis of Algorithms. Running Time. Experimental Studies. Limitations of Experiments. Theoretical Analysis
Outlie ad Readig Aalysis of Algorithms Iput Algorithm Output Ruig time ( 3.) Pseudo-code ( 3.2) Coutig primitive operatios ( 3.3-3.) Asymptotic otatio ( 3.6) Asymptotic aalysis ( 3.7) Case study Aalysis
More informationComputational Geometry
Computatioal Geometry Chapter 4 Liear programmig Duality Smallest eclosig disk O the Ageda Liear Programmig Slides courtesy of Craig Gotsma 4. 4. Liear Programmig - Example Defie: (amout amout cosumed
More informationRunning Time. Analysis of Algorithms. Experimental Studies. Limitations of Experiments
Ruig Time Aalysis of Algorithms Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite amout of time. Most algorithms trasform iput objects ito output objects. The
More informationRunning Time ( 3.1) Analysis of Algorithms. Experimental Studies. Limitations of Experiments
Ruig Time ( 3.1) Aalysis of Algorithms Iput Algorithm Output A algorithm is a step- by- step procedure for solvig a problem i a fiite amout of time. Most algorithms trasform iput objects ito output objects.
More informationAnalysis of Algorithms
Aalysis of Algorithms Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite amout of time. Ruig Time Most algorithms trasform iput objects ito output objects. The
More informationLecture 1: Introduction and Strassen s Algorithm
5-750: Graduate Algorithms Jauary 7, 08 Lecture : Itroductio ad Strasse s Algorithm Lecturer: Gary Miller Scribe: Robert Parker Itroductio Machie models I this class, we will primarily use the Radom Access
More informationMatrix Partitions of Split Graphs
Matrix Partitios of Split Graphs Tomás Feder, Pavol Hell, Ore Shklarsky Abstract arxiv:1306.1967v2 [cs.dm] 20 Ju 2013 Matrix partitio problems geeralize a umber of atural graph partitio problems, ad have
More informationarxiv: v2 [cs.ds] 24 Mar 2018
Similar Elemets ad Metric Labelig o Complete Graphs arxiv:1803.08037v [cs.ds] 4 Mar 018 Pedro F. Felzeszwalb Brow Uiversity Providece, RI, USA pff@brow.edu March 8, 018 We cosider a problem that ivolves
More informationWhat are we going to learn? CSC Data Structures Analysis of Algorithms. Overview. Algorithm, and Inputs
What are we goig to lear? CSC316-003 Data Structures Aalysis of Algorithms Computer Sciece North Carolia State Uiversity Need to say that some algorithms are better tha others Criteria for evaluatio Structure
More informationRecursion. Recursion. Mathematical induction: example. Recursion. The sum of the first n odd numbers is n 2 : Informal proof: Principle:
Recursio Recursio Jordi Cortadella Departmet of Computer Sciece Priciple: Reduce a complex problem ito a simpler istace of the same problem Recursio Itroductio to Programmig Dept. CS, UPC 2 Mathematical
More informationAn Efficient Algorithm for Graph Bisection of Triangularizations
A Efficiet Algorithm for Graph Bisectio of Triagularizatios Gerold Jäger Departmet of Computer Sciece Washigto Uiversity Campus Box 1045 Oe Brookigs Drive St. Louis, Missouri 63130-4899, USA jaegerg@cse.wustl.edu
More information6.854J / J Advanced Algorithms Fall 2008
MIT OpeCourseWare http://ocw.mit.edu 6.854J / 18.415J Advaced Algorithms Fall 2008 For iformatio about citig these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. 18.415/6.854 Advaced Algorithms
More informationOnes Assignment Method for Solving Traveling Salesman Problem
Joural of mathematics ad computer sciece 0 (0), 58-65 Oes Assigmet Method for Solvig Travelig Salesma Problem Hadi Basirzadeh Departmet of Mathematics, Shahid Chamra Uiversity, Ahvaz, Ira Article history:
More informationRelationship between augmented eccentric connectivity index and some other graph invariants
Iteratioal Joural of Advaced Mathematical Scieces, () (03) 6-3 Sciece Publishig Corporatio wwwsciecepubcocom/idexphp/ijams Relatioship betwee augmeted eccetric coectivity idex ad some other graph ivariats
More informationAn Efficient Algorithm for Graph Bisection of Triangularizations
Applied Mathematical Scieces, Vol. 1, 2007, o. 25, 1203-1215 A Efficiet Algorithm for Graph Bisectio of Triagularizatios Gerold Jäger Departmet of Computer Sciece Washigto Uiversity Campus Box 1045, Oe
More informationCombination Labelings Of Graphs
Applied Mathematics E-Notes, (0), - c ISSN 0-0 Available free at mirror sites of http://wwwmaththuedutw/ame/ Combiatio Labeligs Of Graphs Pak Chig Li y Received February 0 Abstract Suppose G = (V; E) is
More informationImproved Random Graph Isomorphism
Improved Radom Graph Isomorphism Tomek Czajka Gopal Paduraga Abstract Caoical labelig of a graph cosists of assigig a uique label to each vertex such that the labels are ivariat uder isomorphism. Such
More informationn n B. How many subsets of C are there of cardinality n. We are selecting elements for such a
4. [10] Usig a combiatorial argumet, prove that for 1: = 0 = Let A ad B be disjoit sets of cardiality each ad C = A B. How may subsets of C are there of cardiality. We are selectig elemets for such a subset
More informationExact Minimum Lower Bound Algorithm for Traveling Salesman Problem
Exact Miimum Lower Boud Algorithm for Travelig Salesma Problem Mohamed Eleiche GeoTiba Systems mohamed.eleiche@gmail.com Abstract The miimum-travel-cost algorithm is a dyamic programmig algorithm to compute
More informationLecture 5. Counting Sort / Radix Sort
Lecture 5. Coutig Sort / Radix Sort T. H. Corme, C. E. Leiserso ad R. L. Rivest Itroductio to Algorithms, 3rd Editio, MIT Press, 2009 Sugkyukwa Uiversity Hyuseug Choo choo@skku.edu Copyright 2000-2018
More informationOn (K t e)-saturated Graphs
Noame mauscript No. (will be iserted by the editor O (K t e-saturated Graphs Jessica Fuller Roald J. Gould the date of receipt ad acceptace should be iserted later Abstract Give a graph H, we say a graph
More informationA RELATIONSHIP BETWEEN BOUNDS ON THE SUM OF SQUARES OF DEGREES OF A GRAPH
J. Appl. Math. & Computig Vol. 21(2006), No. 1-2, pp. 233-238 Website: http://jamc.et A RELATIONSHIP BETWEEN BOUNDS ON THE SUM OF SQUARES OF DEGREES OF A GRAPH YEON SOO YOON AND JU KYUNG KIM Abstract.
More informationLecturers: Sanjam Garg and Prasad Raghavendra Feb 21, Midterm 1 Solutions
U.C. Berkeley CS170 : Algorithms Midterm 1 Solutios Lecturers: Sajam Garg ad Prasad Raghavedra Feb 1, 017 Midterm 1 Solutios 1. (4 poits) For the directed graph below, fid all the strogly coected compoets
More informationAnalysis of Algorithms
Aalysis of Algorithms Ruig Time of a algorithm Ruig Time Upper Bouds Lower Bouds Examples Mathematical facts Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite
More informationA New Morphological 3D Shape Decomposition: Grayscale Interframe Interpolation Method
A ew Morphological 3D Shape Decompositio: Grayscale Iterframe Iterpolatio Method D.. Vizireau Politehica Uiversity Bucharest, Romaia ae@comm.pub.ro R. M. Udrea Politehica Uiversity Bucharest, Romaia mihea@comm.pub.ro
More informationAlgorithm Design Techniques. Divide and conquer Problem
Algorithm Desig Techiques Divide ad coquer Problem Divide ad Coquer Algorithms Divide ad Coquer algorithm desig works o the priciple of dividig the give problem ito smaller sub problems which are similar
More informationA Parallel DFA Minimization Algorithm
A Parallel DFA Miimizatio Algorithm Ambuj Tewari, Utkarsh Srivastava, ad P. Gupta Departmet of Computer Sciece & Egieerig Idia Istitute of Techology Kapur Kapur 208 016,INDIA pg@iitk.ac.i Abstract. I this
More informationCOSC 1P03. Ch 7 Recursion. Introduction to Data Structures 8.1
COSC 1P03 Ch 7 Recursio Itroductio to Data Structures 8.1 COSC 1P03 Recursio Recursio I Mathematics factorial Fiboacci umbers defie ifiite set with fiite defiitio I Computer Sciece sytax rules fiite defiitio,
More information1 Graph Sparsfication
CME 305: Discrete Mathematics ad Algorithms 1 Graph Sparsficatio I this sectio we discuss the approximatio of a graph G(V, E) by a sparse graph H(V, F ) o the same vertex set. I particular, we cosider
More informationCSE 417: Algorithms and Computational Complexity
Time CSE 47: Algorithms ad Computatioal Readig assigmet Read Chapter of The ALGORITHM Desig Maual Aalysis & Sortig Autum 00 Paul Beame aalysis Problem size Worst-case complexity: max # steps algorithm
More informationHow do we evaluate algorithms?
F2 Readig referece: chapter 2 + slides Algorithm complexity Big O ad big Ω To calculate ruig time Aalysis of recursive Algorithms Next time: Litterature: slides mostly The first Algorithm desig methods:
More informationFuzzy Minimal Solution of Dual Fully Fuzzy Matrix Equations
Iteratioal Coferece o Applied Mathematics, Simulatio ad Modellig (AMSM 2016) Fuzzy Miimal Solutio of Dual Fully Fuzzy Matrix Equatios Dequa Shag1 ad Xiaobi Guo2,* 1 Sciece Courses eachig Departmet, Gasu
More informationBig-O Analysis. Asymptotics
Big-O Aalysis 1 Defiitio: Suppose that f() ad g() are oegative fuctios of. The we say that f() is O(g()) provided that there are costats C > 0 ad N > 0 such that for all > N, f() Cg(). Big-O expresses
More informationCSE 2320 Notes 8: Sorting. (Last updated 10/3/18 7:16 PM) Idea: Take an unsorted (sub)array and partition into two subarrays such that.
CSE Notes 8: Sortig (Last updated //8 7:6 PM) CLRS 7.-7., 9., 8.-8. 8.A. QUICKSORT Cocepts Idea: Take a usorted (sub)array ad partitio ito two subarrays such that p q r x y z x y y z Pivot Customarily,
More informationBASED ON ITERATIVE ERROR-CORRECTION
A COHPARISO OF CRYPTAALYTIC PRICIPLES BASED O ITERATIVE ERROR-CORRECTIO Miodrag J. MihaljeviC ad Jova Dj. GoliC Istitute of Applied Mathematics ad Electroics. Belgrade School of Electrical Egieerig. Uiversity
More informationBig-O Analysis. Asymptotics
Big-O Aalysis 1 Defiitio: Suppose that f() ad g() are oegative fuctios of. The we say that f() is O(g()) provided that there are costats C > 0 ad N > 0 such that for all > N, f() Cg(). Big-O expresses
More informationLecture 2: Spectra of Graphs
Spectral Graph Theory ad Applicatios WS 20/202 Lecture 2: Spectra of Graphs Lecturer: Thomas Sauerwald & He Su Our goal is to use the properties of the adjacecy/laplacia matrix of graphs to first uderstad
More informationCompactness of Fuzzy Sets
Compactess of uzzy Sets Amai E. Kadhm Departmet of Egieerig Programs, Uiversity College of Madeat Al-Elem, Baghdad, Iraq. Abstract The objective of this paper is to study the compactess of fuzzy sets i
More informationSolving Fuzzy Assignment Problem Using Fourier Elimination Method
Global Joural of Pure ad Applied Mathematics. ISSN 0973-768 Volume 3, Number 2 (207), pp. 453-462 Research Idia Publicatios http://www.ripublicatio.com Solvig Fuzzy Assigmet Problem Usig Fourier Elimiatio
More informationAverage Connectivity and Average Edge-connectivity in Graphs
Average Coectivity ad Average Edge-coectivity i Graphs Jaehoo Kim, Suil O July 1, 01 Abstract Coectivity ad edge-coectivity of a graph measure the difficulty of breakig the graph apart, but they are very
More informationRandom Graphs and Complex Networks T
Radom Graphs ad Complex Networks T-79.7003 Charalampos E. Tsourakakis Aalto Uiversity Lecture 3 7 September 013 Aoucemet Homework 1 is out, due i two weeks from ow. Exercises: Probabilistic iequalities
More informationImproving Information Retrieval System Security via an Optimal Maximal Coding Scheme
Improvig Iformatio Retrieval System Security via a Optimal Maximal Codig Scheme Dogyag Log Departmet of Computer Sciece, City Uiversity of Hog Kog, 8 Tat Chee Aveue Kowloo, Hog Kog SAR, PRC dylog@cs.cityu.edu.hk
More informationReversible Realization of Quaternary Decoder, Multiplexer, and Demultiplexer Circuits
Egieerig Letters, :, EL Reversible Realizatio of Quaterary Decoder, Multiplexer, ad Demultiplexer Circuits Mozammel H.. Kha, Member, ENG bstract quaterary reversible circuit is more compact tha the correspodig
More informationRecursion. Computer Science S-111 Harvard University David G. Sullivan, Ph.D. Review: Method Frames
Uit 4, Part 3 Recursio Computer Sciece S-111 Harvard Uiversity David G. Sulliva, Ph.D. Review: Method Frames Whe you make a method call, the Java rutime sets aside a block of memory kow as the frame of
More informationName of the Student: Unit I (Logic and Proofs) 1) Truth Table: Conjunction Disjunction Conditional Biconditional
SUBJECT NAME : Discrete Mathematics SUBJECT CODE : MA 2265 MATERIAL NAME : Formula Material MATERIAL CODE : JM08ADM009 (Sca the above QR code for the direct dowload of this material) Name of the Studet:
More informationLecture Notes 6 Introduction to algorithm analysis CSS 501 Data Structures and Object-Oriented Programming
Lecture Notes 6 Itroductio to algorithm aalysis CSS 501 Data Structures ad Object-Orieted Programmig Readig for this lecture: Carrao, Chapter 10 To be covered i this lecture: Itroductio to algorithm aalysis
More informationSome cycle and path related strongly -graphs
Some cycle ad path related strogly -graphs I. I. Jadav, G. V. Ghodasara Research Scholar, R. K. Uiversity, Rajkot, Idia. H. & H. B. Kotak Istitute of Sciece,Rajkot, Idia. jadaviram@gmail.com gaurag ejoy@yahoo.co.i
More informationMAXIMUM MATCHINGS IN COMPLETE MULTIPARTITE GRAPHS
Fura Uiversity Electroic Joural of Udergraduate Matheatics Volue 00, 1996 6-16 MAXIMUM MATCHINGS IN COMPLETE MULTIPARTITE GRAPHS DAVID SITTON Abstract. How ay edges ca there be i a axiu atchig i a coplete
More information1.2 Binomial Coefficients and Subsets
1.2. BINOMIAL COEFFICIENTS AND SUBSETS 13 1.2 Biomial Coefficiets ad Subsets 1.2-1 The loop below is part of a program to determie the umber of triagles formed by poits i the plae. for i =1 to for j =
More informationMinimum Spanning Trees
Presetatio for use with the textbook, lgorithm esig ad pplicatios, by M. T. Goodrich ad R. Tamassia, Wiley, 0 Miimum Spaig Trees 0 Goodrich ad Tamassia Miimum Spaig Trees pplicatio: oectig a Network Suppose
More informationThe Adjacency Matrix and The nth Eigenvalue
Spectral Graph Theory Lecture 3 The Adjacecy Matrix ad The th Eigevalue Daiel A. Spielma September 5, 2012 3.1 About these otes These otes are ot ecessarily a accurate represetatio of what happeed i class.
More information. Written in factored form it is easy to see that the roots are 2, 2, i,
CMPS A Itroductio to Programmig Programmig Assigmet 4 I this assigmet you will write a java program that determies the real roots of a polyomial that lie withi a specified rage. Recall that the roots (or
More informationTheory of Fuzzy Soft Matrix and its Multi Criteria in Decision Making Based on Three Basic t-norm Operators
Theory of Fuzzy Soft Matrix ad its Multi Criteria i Decisio Makig Based o Three Basic t-norm Operators Md. Jalilul Islam Modal 1, Dr. Tapa Kumar Roy 2 Research Scholar, Dept. of Mathematics, BESUS, Howrah-711103,
More informationMinimum Spanning Trees. Application: Connecting a Network
Miimum Spaig Tree // : Presetatio for use with the textbook, lgorithm esig ad pplicatios, by M. T. oodrich ad R. Tamassia, Wiley, Miimum Spaig Trees oodrich ad Tamassia Miimum Spaig Trees pplicatio: oectig
More informationCIS 121 Data Structures and Algorithms with Java Fall Big-Oh Notation Tuesday, September 5 (Make-up Friday, September 8)
CIS 11 Data Structures ad Algorithms with Java Fall 017 Big-Oh Notatio Tuesday, September 5 (Make-up Friday, September 8) Learig Goals Review Big-Oh ad lear big/small omega/theta otatios Practice solvig
More informationCIS 121 Data Structures and Algorithms with Java Spring Stacks and Queues Monday, February 12 / Tuesday, February 13
CIS Data Structures ad Algorithms with Java Sprig 08 Stacks ad Queues Moday, February / Tuesday, February Learig Goals Durig this lab, you will: Review stacks ad queues. Lear amortized ruig time aalysis
More informationChapter 9. Pointers and Dynamic Arrays. Copyright 2015 Pearson Education, Ltd.. All rights reserved.
Chapter 9 Poiters ad Dyamic Arrays Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Overview 9.1 Poiters 9.2 Dyamic Arrays Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Slide 9-3
More informationThe isoperimetric problem on the hypercube
The isoperimetric problem o the hypercube Prepared by: Steve Butler November 2, 2005 1 The isoperimetric problem We will cosider the -dimesioal hypercube Q Recall that the hypercube Q is a graph whose
More informationHash Tables. Presentation for use with the textbook Algorithm Design and Applications, by M. T. Goodrich and R. Tamassia, Wiley, 2015.
Presetatio for use with the textbook Algorithm Desig ad Applicatios, by M. T. Goodrich ad R. Tamassia, Wiley, 2015 Hash Tables xkcd. http://xkcd.com/221/. Radom Number. Used with permissio uder Creative
More informationGraphs. Minimum Spanning Trees. Slides by Rose Hoberman (CMU)
Graphs Miimum Spaig Trees Slides by Rose Hoberma (CMU) Problem: Layig Telephoe Wire Cetral office 2 Wirig: Naïve Approach Cetral office Expesive! 3 Wirig: Better Approach Cetral office Miimize the total
More informationTHE COMPETITION NUMBERS OF JOHNSON GRAPHS
Discussioes Mathematicae Graph Theory 30 (2010 ) 449 459 THE COMPETITION NUMBERS OF JOHNSON GRAPHS Suh-Ryug Kim, Boram Park Departmet of Mathematics Educatio Seoul Natioal Uiversity, Seoul 151 742, Korea
More informationProtected points in ordered trees
Applied Mathematics Letters 008 56 50 www.elsevier.com/locate/aml Protected poits i ordered trees Gi-Sag Cheo a, Louis W. Shapiro b, a Departmet of Mathematics, Sugkyukwa Uiversity, Suwo 440-746, Republic
More informationBezier curves. Figure 2 shows cubic Bezier curves for various control points. In a Bezier curve, only
Edited: Yeh-Liag Hsu (998--; recommeded: Yeh-Liag Hsu (--9; last updated: Yeh-Liag Hsu (9--7. Note: This is the course material for ME55 Geometric modelig ad computer graphics, Yua Ze Uiversity. art of
More informationOn Infinite Groups that are Isomorphic to its Proper Infinite Subgroup. Jaymar Talledo Balihon. Abstract
O Ifiite Groups that are Isomorphic to its Proper Ifiite Subgroup Jaymar Talledo Baliho Abstract Two groups are isomorphic if there exists a isomorphism betwee them Lagrage Theorem states that the order
More informationImage Segmentation EEE 508
Image Segmetatio Objective: to determie (etract) object boudaries. It is a process of partitioig a image ito distict regios by groupig together eighborig piels based o some predefied similarity criterio.
More information4-Prime cordiality of some cycle related graphs
Available at http://pvamu.edu/aam Appl. Appl. Math. ISSN: 193-9466 Vol. 1, Issue 1 (Jue 017), pp. 30 40 Applicatios ad Applied Mathematics: A Iteratioal Joural (AAM) 4-Prime cordiality of some cycle related
More informationA Comparative Study of Positive and Negative Factorials
A Comparative Study of Positive ad Negative Factorials A. M. Ibrahim, A. E. Ezugwu, M. Isa Departmet of Mathematics, Ahmadu Bello Uiversity, Zaria Abstract. This paper preset a comparative study of the
More informationMatrix representation of a solution of a combinatorial problem of the group theory
Matrix represetatio of a solutio of a combiatorial problem of the group theory Krasimir Yordzhev, Lilyaa Totia Faculty of Mathematics ad Natural Scieces South-West Uiversity 66 Iva Mihailov Str, 2700 Blagoevgrad,
More informationVisualization of Gauss-Bonnet Theorem
Visualizatio of Gauss-Boet Theorem Yoichi Maeda maeda@keyaki.cc.u-tokai.ac.jp Departmet of Mathematics Tokai Uiversity Japa Abstract: The sum of exteral agles of a polygo is always costat, π. There are
More informationA New Bit Wise Technique for 3-Partitioning Algorithm
Special Issue of Iteratioal Joural of Computer Applicatios (0975 8887) o Optimizatio ad O-chip Commuicatio, No.1. Feb.2012, ww.ijcaolie.org A New Bit Wise Techique for 3-Partitioig Algorithm Rajumar Jai
More informationSuper Vertex Magic and E-Super Vertex Magic. Total Labelling
Proceedigs of the Iteratioal Coferece o Applied Mathematics ad Theoretical Computer Sciece - 03 6 Super Vertex Magic ad E-Super Vertex Magic Total Labellig C.J. Deei ad D. Atoy Xavier Abstract--- For a
More informationOn Alliance Partitions and Bisection Width for Planar Graphs
Joural of Graph Algorithms ad Applicatios http://jgaa.ifo/ vol. 17, o. 6, pp. 599 614 (013) DOI: 10.7155/jgaa.00307 O Alliace Partitios ad Bisectio Width for Plaar Graphs Marti Olse 1 Morte Revsbæk 1 AU
More informationThompson s Group F (p + 1) is not Minimally Almost Convex
Thompso s Group F (p + ) is ot Miimally Almost Covex Claire Wladis Thompso s Group F (p + ). A Descriptio of F (p + ) Thompso s group F (p + ) ca be defied as the group of piecewiseliear orietatio-preservig
More informationInformed Search. Russell and Norvig Chap. 3
Iformed Search Russell ad Norvig Chap. 3 Not all search directios are equally promisig Outlie Iformed: use problem-specific kowledge Add a sese of directio to search: work toward the goal Heuristic fuctios:
More informationMean cordiality of some snake graphs
Palestie Joural of Mathematics Vol. 4() (015), 49 445 Palestie Polytechic Uiversity-PPU 015 Mea cordiality of some sake graphs R. Poraj ad S. Sathish Narayaa Commuicated by Ayma Badawi MSC 010 Classificatios:
More informationXiaozhou (Steve) Li, Atri Rudra, Ram Swaminathan. HP Laboratories HPL Keyword(s): graph coloring; hardness of approximation
Flexible Colorig Xiaozhou (Steve) Li, Atri Rudra, Ram Swamiatha HP Laboratories HPL-2010-177 Keyword(s): graph colorig; hardess of approximatio Abstract: Motivated b y reliability cosideratios i data deduplicatio
More informationBOOLEAN MATHEMATICS: GENERAL THEORY
CHAPTER 3 BOOLEAN MATHEMATICS: GENERAL THEORY 3.1 ISOMORPHIC PROPERTIES The ame Boolea Arithmetic was chose because it was discovered that literal Boolea Algebra could have a isomorphic umerical aspect.
More informationSub-Exponential Algorithms for 0/1 Knapsack and Bin Packing
Sub-Expoetial Algorithms for 0/1 Kapsack ad Bi Packig Thomas E. O Neil Computer Sciece Departmet Uiversity of North Dakota Grad Forks, ND, USA 58202-9015 Abstract - This paper presets simple algorithms
More information3. b. Present a combinatorial argument that for all positive integers n : : 2 n
. b. Preset a combiatorial argumet that for all positive itegers : : Cosider two distict sets A ad B each of size. Sice they are distict, the cardiality of A B is. The umber of ways of choosig a pair of
More informationEE123 Digital Signal Processing
Last Time EE Digital Sigal Processig Lecture 7 Block Covolutio, Overlap ad Add, FFT Discrete Fourier Trasform Properties of the Liear covolutio through circular Today Liear covolutio with Overlap ad add
More informationChapter 24. Sorting. Objectives. 1. To study and analyze time efficiency of various sorting algorithms
Chapter 4 Sortig 1 Objectives 1. o study ad aalyze time efficiecy of various sortig algorithms 4. 4.7.. o desig, implemet, ad aalyze bubble sort 4.. 3. o desig, implemet, ad aalyze merge sort 4.3. 4. o
More informationA Generalized Set Theoretic Approach for Time and Space Complexity Analysis of Algorithms and Functions
Proceedigs of the 10th WSEAS Iteratioal Coferece o APPLIED MATHEMATICS, Dallas, Texas, USA, November 1-3, 2006 316 A Geeralized Set Theoretic Approach for Time ad Space Complexity Aalysis of Algorithms
More informationANN WHICH COVERS MLP AND RBF
ANN WHICH COVERS MLP AND RBF Josef Boští, Jaromír Kual Faculty of Nuclear Scieces ad Physical Egieerig, CTU i Prague Departmet of Software Egieerig Abstract Two basic types of artificial eural etwors Multi
More information5.3 Recursive definitions and structural induction
/8/05 5.3 Recursive defiitios ad structural iductio CSE03 Discrete Computatioal Structures Lecture 6 A recursively defied picture Recursive defiitios e sequece of powers of is give by a = for =0,,, Ca
More informationPython Programming: An Introduction to Computer Science
Pytho Programmig: A Itroductio to Computer Sciece Chapter 1 Computers ad Programs 1 Objectives To uderstad the respective roles of hardware ad software i a computig system. To lear what computer scietists
More informationSolution printed. Do not start the test until instructed to do so! CS 2604 Data Structures Midterm Spring, Instructions:
CS 604 Data Structures Midterm Sprig, 00 VIRG INIA POLYTECHNIC INSTITUTE AND STATE U T PROSI M UNI VERSI TY Istructios: Prit your ame i the space provided below. This examiatio is closed book ad closed
More informationAnalysis Metrics. Intro to Algorithm Analysis. Slides. 12. Alg Analysis. 12. Alg Analysis
Itro to Algorithm Aalysis Aalysis Metrics Slides. Table of Cotets. Aalysis Metrics 3. Exact Aalysis Rules 4. Simple Summatio 5. Summatio Formulas 6. Order of Magitude 7. Big-O otatio 8. Big-O Theorems
More informationCIS 121 Data Structures and Algorithms with Java Spring Stacks, Queues, and Heaps Monday, February 18 / Tuesday, February 19
CIS Data Structures ad Algorithms with Java Sprig 09 Stacks, Queues, ad Heaps Moday, February 8 / Tuesday, February 9 Stacks ad Queues Recall the stack ad queue ADTs (abstract data types from lecture.
More information