High-Performance Parallel Graph Coloring with Strong Guarantees on Work, Depth, and Quality
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
A Fast and Scalable Graph Coloring Algorithm for Multi-Core and Many-Core Architectures
A Fast and Scalable Graph Coloring Algorithm for Multi-core and Many-core Architectures Georgios Rokos1, Gerard Gorman2, and Paul H J Kelly1 1 Software Peroformance Optimisation Group, Department of Computing 2 Applied Modelling and Computation Group, Department of Earth Science and Engineering Imperial College London, South Kensington Campus, London SW7 2AZ, United Kingdom, fgeorgios.rokos09,g.gorman,[email protected] Abstract. Irregular computations on unstructured data are an impor- tant class of problems for parallel programming. Graph coloring is often an important preprocessing step, e.g. as a way to perform dependency analysis for safe parallel execution. The total run time of a coloring algo- rithm adds to the overall parallel overhead of the application whereas the number of colors used determines the amount of exposed parallelism. A fast and scalable coloring algorithm using as few colors as possible is vi- tal for the overall parallel performance and scalability of many irregular applications that depend upon runtime dependency analysis. C¸ataly¨ureket al. have proposed a graph coloring algorithm which relies on speculative, local assignment of colors. In this paper we present an improved version which runs even more optimistically with less thread synchronization and reduced number of conflicts compared to C¸ataly¨urek et al.'s algorithm. We show that the new technique scales better on multi- core and many-core systems and performs up to 1.5x faster than its pre- decessor on graphs with high-degree vertices, while keeping the number of colors at the same near-optimal levels. Keywords: Graph Coloring; Greedy Coloring; First-Fit Coloring; Ir- regular Data; Parallel Graph Algorithms; Shared-Memory Parallelism; Optimistic Execution; Many-core Architectures; Intel®Xeon Phi™ 1 Introduction Many modern applications are built around algorithms which operate on irreg- ular data structures, usually in form of graphs. -
I?'!'-Comparability Graphs
Discrete Mathematics 74 (1989) 173-200 173 North-Holland I?‘!‘-COMPARABILITYGRAPHS C.T. HOANG Department of Computer Science, Rutgers University, New Brunswick, NJ 08903, U.S.A. and B.A. REED Discrete Mathematics Group, Bell Communications Research, Morristown, NJ 07950, U.S.A. In 1981, Chv&tal defined the class of perfectly orderable graphs. This class of perfect graphs contains the comparability graphs. In this paper, we introduce a new class of perfectly orderable graphs, the &comparability graphs. This class generalizes comparability graphs in a natural way. We also prove a decomposition theorem which leads to a structural characteriza- tion of &comparability graphs. Using this characterization, we develop a polynomial-time recognition algorithm and polynomial-time algorithms for the clique and colouring problems for &comparability graphs. 1. Introduction A natural way to color the vertices of a graph is to put them in some order v*cv~<” l < v, and then assign colors in the following manner: (1) Consider the vertxes sequentially (in the sequence given by the order) (2) Assign to each Vi the smallest color (positive integer) not used on any neighbor vi of Vi with j c i. We shall call this the greedy coloring algorithm. An order < of a graph G is perfect if for each subgraph H of G, the greedy algorithm applied to H, gives an optimal coloring of H. An obstruction in a ordered graph (G, <) is a set of four vertices {a, b, c, d} with edges ab, bc, cd (and no other edge) and a c b, d CC. Clearly, if < is a perfect order on G, then (G, C) contains no obstruction (because the chromatic number of an obstruction is twu, but the greedy coloring algorithm uses three colors). -
Indian Journal of Science ANALYSIS International Journal for Science ISSN 2319 – 7730 EISSN 2319 – 7749
Indian Journal of Science ANALYSIS International Journal for Science ISSN 2319 – 7730 EISSN 2319 – 7749 Graph colouring problem applied in genetic algorithm Malathi R Assistant Professor, Dept of Mathematics, Scsvmv University, Enathur, Kanchipuram, Tamil Nadu 631561, India, Email Id: [email protected] Publication History Received: 06 January 2015 Accepted: 05 February 2015 Published: 18 February 2015 Citation Malathi R. Graph colouring problem applied in genetic algorithm. Indian Journal of Science, 2015, 13(38), 37-41 ABSTRACT In this paper we present a hybrid technique that applies a genetic algorithm followed by wisdom of artificial crowds that approach to solve the graph-coloring problem. The genetic algorithm described here, utilizes more than one parent selection and mutation methods depending u p on the state of fitness of its best solution. This results in shifting the solution to the global optimum, more quickly than using a single parent selection or mutation method. The algorithm is tested against the standard DIMACS benchmark tests while, limiting the number of usable colors to the chromatic numbers. The proposed algorithm succeeded to solve the sample data set and even outperformed a recent approach in terms of the minimum number of colors needed to color some of the graphs. The Graph Coloring Problem (GCP) is also known as complete problem. Graph coloring also includes vertex coloring and edge coloring. However, mostly the term graph coloring refers to vertex coloring rather than edge coloring. Given a number of vertices, which form a connected graph, the objective is that to color each vertex so that if two vertices are connected in the graph (i.e. -
COLORING and DEGENERACY for DETERMINING VERY LARGE and SPARSE DERIVATIVE MATRICES ASHRAFUL HUQ SUNY Bachelor of Science, Chittag
COLORING AND DEGENERACY FOR DETERMINING VERY LARGE AND SPARSE DERIVATIVE MATRICES ASHRAFUL HUQ SUNY Bachelor of Science, Chittagong University of Engineering & Technology, 2013 A Thesis Submitted to the School of Graduate Studies of the University of Lethbridge in Partial Fulfillment of the Requirements for the Degree MASTER OF SCIENCE Department of Mathematics and Computer Science University of Lethbridge LETHBRIDGE, ALBERTA, CANADA c Ashraful Huq Suny, 2016 COLORING AND DEGENERACY FOR DETERMINING VERY LARGE AND SPARSE DERIVATIVE MATRICES ASHRAFUL HUQ SUNY Date of Defence: December 19, 2016 Dr. Shahadat Hossain Supervisor Professor Ph.D. Dr. Daya Gaur Committee Member Professor Ph.D. Dr. Robert Benkoczi Committee Member Associate Professor Ph.D. Dr. Howard Cheng Chair, Thesis Examination Com- Associate Professor Ph.D. mittee Dedication To My Parents. iii Abstract Estimation of large sparse Jacobian matrix is a prerequisite for many scientific and engi- neering problems. It is known that determining the nonzero entries of a sparse matrix can be modeled as a graph coloring problem. To find out the optimal partitioning, we have proposed a new algorithm that combines existing exact and heuristic algorithms. We have introduced degeneracy and maximum k-core for sparse matrices to solve the problem in stages. Our combined approach produce better results in terms of partitioning than DSJM and for some test instances, we report optimal partitioning for the first time. iv Acknowledgments I would like to express my deep acknowledgment and profound sense of gratitude to my supervisor Dr. Shahadat Hossain, for his continuous guidance, support, cooperation, and persistent encouragement throughout the journey of my MSc program. -
Graph Coloring Major Themes Vertex Colorings Χ(G) =
CSC 1300 – Discrete Structures 17: Graph Coloring Major Themes • Vertex coloring • Chromac number χ(G) Graph Coloring • Map coloring • Greedy coloring algorithm • CSC 1300 – Discrete Structures Applicaons Villanova University Villanova CSC 1300 - Dr Papalaskari 1 Villanova CSC 1300 - Dr Papalaskari 2 What is the least number of colors needed for the verFces of Vertex Colorings this graph so that no two adjacent verFces have the same color? Adjacent ver,ces cannot have the same color χ(G) = Chromac number χ(G) = least number of colors needed to color the verFces of a graph so that no two adjacent verFces are assigned the same color? Source: “Discrete Mathemacs” by Chartrand & Zhang, 2011, Waveland Press. Source: “Discrete Mathemacs with Ducks” by Sara-Marie Belcastro, 2012, CRC Press, Fig 13.1. 4 5 Dr Papalaskari 1 CSC 1300 – Discrete Structures 17: Graph Coloring Map Coloring Map Coloring What is the least number of colors needed to color a map? Region è vertex Common border è edge G A D C E B F G H I Villanova CSC 1300 - Dr Papalaskari 8 Villanova CSC 1300 - Dr Papalaskari 9 Coloring the USA Four color theorem Every planar graph is 4-colorable The proof of this theorem is one of the most famous and controversial proofs in mathemacs, because it relies on a computer program. It was first presented in 1976. A more recent reformulaon can be found in this arFcle: Formal Proof – The Four Color Theorem, Georges Gonthier, NoFces of the American Mathemacal Society, December 2008. hp://www.printco.com/pages/State%20Map%20Requirements/USA-colored-12-x-8.gif -
The Harmonious Coloring Problem Is NP-Complete for Interval and Permutation Graphsଁ Katerina Asdre, Kyriaki Ioannidou, Stavros D
Discrete Applied Mathematics 155 (2007) 2377–2382 www.elsevier.com/locate/dam Note The harmonious coloring problem is NP-complete for interval and permutation graphsଁ Katerina Asdre, Kyriaki Ioannidou, Stavros D. Nikolopoulos Department of Computer Science, University of Ioannina, P.O. Box 1186, GR-45110 Ioannina, Greece Received 4 November 2006; received in revised form 25 May 2007; accepted 6 July 2007 Available online 14 September 2007 Abstract In this paper, we prove that the harmonious coloring problem is NP-complete for connected interval and permutation graphs. Given a simple graph G, a harmonious coloring of G is a proper vertex coloring such that each pair of colors appears together on at most one edge. The harmonious chromatic number is the least integer k for which G admits a harmonious coloring with k colors. Extending previous work on the NP-completeness of the harmonious coloring problem when restricted to the class of disconnected graphs which are simultaneously cographs and interval graphs, we prove that the problem is also NP-complete for connected interval and permutation graphs. © 2007 Elsevier B.V. All rights reserved. Keywords: Harmonious coloring; Harmonious chromatic number; Achromatic number; Interval graphs; Permutation graphs; NP-completeness 1. Introduction Many NP-complete problems on arbitrary graphs admit polynomial time algorithms when restricted to the classes of interval graphs and cographs; NP-complete problems for these two classes of graphs that become solvable in polynomial time can be found in [1,3,7,12,15,16]. However, the pair-complete coloring problem, which is NP-hard on arbitrary graphs [17], remains NP-complete when restricted to graphs that are simultaneously interval and cographs [4].Apair- complete coloring of a simple graph G is a proper vertex coloring such that each pair of colors appears together on at least one edge, while the achromatic number (G) is the largest integer k for which G admits a pair-complete coloring with k colors. -
3-Coloring Gnp3 in Polynomial Expected Time
Mathematisch-Naturwissenschaftliche Fakultat¨ II Institut fur¨ Informatik Lehrstuhl fur¨ Algorithmen und Komplexit¨at Coloring sparse random k-colorable graphs in polynomial expected time Diplomarbeit eingereicht von: Julia B¨ottcher Gutachter: Dr. Amin Coja-Oghlan Dr. Mihyun Kang Berlin, den 5. Januar 2005 Erkl¨arung Hiermit erkl¨are ich, die vorliegende Arbeit selbstst¨andig verfasst und keine anderen als die angegebenen Hilfsmittel verwendet zu haben. Ich bin damit einverstanden, dass die vorliegen- de Arbeit in der Zentralbibliothek Naturwissenschaften der Humboldt-Universit¨at zu Berlin ¨offentlich ausgelegt wird. Berlin, den 5. Januar 2005 Julia B¨ottcher Zusammenfassung Nach wie vor stellt das Graphenf¨arbungsproblem eine der anspruchsvollsten algorithmischen Aufgaben innerhalb der Graphentheorie dar. So blieb bisher nicht nur die Suche nach effizienten Methoden, die dieses Problem exakt l¨osen, erfolglos. Gem¨aß eines Resultates von Feige und Kilian [22] ist auch die Existenz von signifikant besseren Approximationsalgorithmen als dem Trivialen, der jedem Knoten eine eigene Farbe zuordnet, sehr unwahrscheinlich. Diese Tatsache motiviert die Suche nach Algorithmen, die das Problem entweder nicht in allen sondern nur den meisten F¨allen entscheiden, dafur¨ aber von polynomieller Laufzeitkomplexit¨at sind, oder aber stets eine korrekte L¨osung ausgeben, eine polynomielle Laufzeit jedoch nur im Durchschnitt garantieren. Ein Algorithmus der ersterem Paradigma folgt, wurde von Alon und Kahale [2] fur¨ die fol- gende Klasse zuf¨alliger k-f¨arbbarer Graphen entwickelt: Konstruiere einen Graphen mit Gn,p,k einer Knotenmenge V der Kardinalit¨at n durch Partitionierung von V in k Mengen gleicher Gr¨oße und anschließendes Hinzufugen¨ der m¨oglichen Kanten zwischen diesen Mengen mit Wahrscheinlichkeit jeweils p. -
Results on the Grundy Chromatic Number of Graphs Manouchehr Zaker
Discrete Mathematics 306 (2006) 3166–3173 www.elsevier.com/locate/disc Results on the Grundy chromatic number of graphs Manouchehr Zaker Institute for Advanced Studies in Basic Sciences, 45195-1159 Zanjan, Iran Received 7 November 2003; received in revised form 22 June 2005; accepted 22 June 2005 Available online 7 August 2006 Abstract Given a graph G,byaGrundy k-coloring of G we mean any proper k-vertex coloring of G such that for each two colors i and j, i<j, every vertex of G colored by j has a neighbor with color i. The maximum k for which there exists a Grundy k-coloring is denoted by (G) and called Grundy (chromatic) number of G. We first discuss the fixed-parameter complexity of determining (G)k, for any fixed integer k and show that it is a polynomial time problem. But in general, Grundy number is an NP-complete problem. We show that it is NP-complete even for the complement of bipartite graphs and describe the Grundy number of these graphs in terms of the minimum edge dominating number of their complements. Next we obtain some additive Nordhaus–Gaddum-type inequalities concerning (G) and (Gc), for a few family of graphs. We introduce well-colored graphs, which are graphs G for which applying every greedy coloring results in a coloring of G with (G) colors. Equivalently G is well colored if (G) = (G). We prove that the recognition problem of well-colored graphs is a coNP-complete problem. © 2006 Elsevier B.V. All rights reserved. Keywords: Colorings; Chromatic number; Grundy number; First-fit colorings; NP-complete; Edge dominating sets 1. -
Algorithmic Graph Theory Part III Perfect Graphs and Their Subclasses
Algorithmic Graph Theory Part III Perfect Graphs and Their Subclasses Martin Milanicˇ [email protected] University of Primorska, Koper, Slovenia Dipartimento di Informatica Universita` degli Studi di Verona, March 2013 1/55 What we’ll do 1 THE BASICS. 2 PERFECT GRAPHS. 3 COGRAPHS. 4 CHORDAL GRAPHS. 5 SPLIT GRAPHS. 6 THRESHOLD GRAPHS. 7 INTERVAL GRAPHS. 2/55 THE BASICS. 2/55 Induced Subgraphs Recall: Definition Given two graphs G = (V , E) and G′ = (V ′, E ′), we say that G is an induced subgraph of G′ if V ⊆ V ′ and E = {uv ∈ E ′ : u, v ∈ V }. Equivalently: G can be obtained from G′ by deleting vertices. Notation: G < G′ 3/55 Hereditary Graph Properties Hereditary graph property (hereditary graph class) = a class of graphs closed under deletion of vertices = a class of graphs closed under taking induced subgraphs Formally: a set of graphs X such that G ∈ X and H < G ⇒ H ∈ X . 4/55 Hereditary Graph Properties Hereditary graph property (Hereditary graph class) = a class of graphs closed under deletion of vertices = a class of graphs closed under taking induced subgraphs Examples: forests complete graphs line graphs bipartite graphs planar graphs graphs of degree at most ∆ triangle-free graphs perfect graphs 5/55 Hereditary Graph Properties Why hereditary graph classes? Vertex deletions are very useful for developing algorithms for various graph optimization problems. Every hereditary graph property can be described in terms of forbidden induced subgraphs. 6/55 Hereditary Graph Properties H-free graph = a graph that does not contain H as an induced subgraph Free(H) = the class of H-free graphs Free(M) := H∈M Free(H) M-free graphT = a graph in Free(M) Proposition X hereditary ⇐⇒ X = Free(M) for some M M = {all (minimal) graphs not in X} The set M is the set of forbidden induced subgraphs for X. -
Greedy Defining Sets of Graphs
Greedy defining sets of graphs Manouchehr Zaker Department of Mathematical Sciences, Sharif University of Technology, P.O. Box 11365-9415, Tehran, IRAN [email protected] Abstract For a graph G and an order a on V(G), we define a greedy defining set as a subset S of V(G) with an assignment of colors to vertices in S, such that the pre-coloring can be extended to a x( G)-coloring of G by the greedy coloring of (G, a). A greedy defining set ofaX( G)-coloring C of G is a greedy defining set, which results in the coloring C (by the greedy procedure). We denote the size of a greedy defining set of C with minimum cardinality by G D N (G, a, C). In this paper we show that the problem of determining GDN(G,a,C), for an instance (G,a,C) is an NP-complete problem. 1 Introduction and preliminaries We begin with some terminology and notation which are used throughout the paper. For the other necessary definitions and notation, we refer the reader to texts such as [4]. A harmonious coloring of a graph G is a proper vertex coloring of G, such that the subgraph induced on any two different colors has at most one edge. By a hypergraph we mean an ordinary hypergraph which consists of a vertex set V and a collection of subsets of V, called (hyper)edges. In a hypergraph 1£ a block ing set is a subset of the vertex set which intersects every edge of 1£. -
The Edge Grundy Numbers of Some Graphs
b b International Journal of Mathematics and M Computer Science, 12(2017), no. 1, 13–26 CS The Edge Grundy Numbers of Some Graphs Loren Anderson1, Matthew DeVilbiss2, Sarah Holliday3, Peter Johnson4, Anna Kite5, Ryan Matzke6, Jessica McDonald4 1School of Mathematics University of Minnesota Twin Cities Minneapolis, MN 55455, USA 2Department of Mathematics, Statistics, and Computer Science University of Illinois at Chicago Chicago, IL 60607-7045, USA 3Department of Mathematics Kennesaw State University Kennesaw, GA 30144, USA 4Department of Mathematics and Statistics Auburn University Auburn, AL 36849, USA 5Department of Mathematics Wayland Baptist University Plainview, TX 79072, USA 6Department of Mathematics Gettysburg College Gettysburg, PA 17325, USA email: [email protected], [email protected], [email protected], [email protected], [email protected], [email protected] (Received October 27, 2016, Accepted November 19, 2016) Key words and phrases: Grundy coloring, edge Grundy coloring, line graph, grid. AMS (MOS) Subject Classifications: 05C15. This research was supported by NSF grant no. 1262930. ISSN 1814-0432, 2017 http://ijmcs.future-in-tech.net 14 Anderson, DeVilbiss, Holliday, Johnson, Kite, Matzke, McDonald Abstract The edge Grundy numbers of graphs in a number of different classes are determined, notably for the complete and the complete bipartite graphs, as well as for the Petersen graph, the grids, and the cubes. Except for small-graph exceptions, these edge Grundy numbers turn out to equal a natural upper bound of the edge Grundy number, or to be one less than that bound. 1 Grundy colorings and Grundy numbers A Grundy coloring of a (finite simple) graph G is a proper coloring of the vertices of G with positive integers with the property that if v ∈ V (G) is colored with c > 1, then all the colors 1,...,c − 1 appear on neighbors of v. -
Chordal Graphs MPRI 2017–2018
Chordal graphs MPRI 2017{2018 Chordal graphs MPRI 2017{2018 Michel Habib [email protected] http://www.irif.fr/~habib Sophie Germain, septembre 2017 Chordal graphs MPRI 2017{2018 Schedule Chordal graphs Representation of chordal graphs LBFS and chordal graphs More structural insights of chordal graphs Other classical graph searches and chordal graphs Greedy colorings Chordal graphs MPRI 2017{2018 Chordal graphs Definition A graph is chordal iff it has no chordless cycle of length ≥ 4 or equivalently it has no induced cycle of length ≥ 4. I Chordal graphs are hereditary I Interval graphs are chordal Chordal graphs MPRI 2017{2018 Chordal graphs Applications I Many NP-complete problems for general graphs are polynomial for chordal graphs. I Graph theory : Treewidth (resp. pathwidth) are very important graph parameters that measure distance from a chordal graph (resp. interval graph). 1 I Perfect phylogeny 1. In fact chordal graphs were first defined in a biological modelisation pers- pective ! Chordal graphs MPRI 2017{2018 Chordal graphs G.A. Dirac, On rigid circuit graphs, Abh. Math. Sem. Univ. Hamburg, 38 (1961), pp. 71{76 Chordal graphs MPRI 2017{2018 Representation of chordal graphs About Representations I Interval graphs are chordal graphs I How can we represent chordal graphs ? I As an intersection of some family ? I This family must generalize intervals on a line Chordal graphs MPRI 2017{2018 Representation of chordal graphs Fundamental objects to play with I Maximal Cliques under inclusion I We can have exponentially many maximal cliques : A complete graph Kn in which each vertex is replaced by a pair of false twins has exactly 2n maximal cliques.