Download or read book Broadcast Domination Algorithms for Interval Graphs Series parallel Graphs and Trees written by Jean R. S. Blair and published by . This book was released on 2003 with total page 48 pages. Available in PDF, EPUB and Kindle. Book excerpt:

Download or read book Structures of Domination in Graphs written by Teresa W. Haynes and published by Springer Nature. This book was released on 2021-05-04 with total page 536 pages. Available in PDF, EPUB and Kindle. Book excerpt: This volume comprises 17 contributions that present advanced topics in graph domination, featuring open problems, modern techniques, and recent results. The book is divided into 3 parts. The first part focuses on several domination-related concepts: broadcast domination, alliances, domatic numbers, dominator colorings, irredundance in graphs, private neighbor concepts, game domination, varieties of Roman domination and spectral graph theory. The second part covers domination in hypergraphs, chessboards, and digraphs and tournaments. The third part focuses on the development of algorithms and complexity of signed, minus and majority domination, power domination, and alliances in graphs. The third part also includes a chapter on self-stabilizing algorithms. Of extra benefit to the reader, the first chapter includes a glossary of commonly used terms. The book is intended to provide a reference for established researchers in the fields of domination and graph theory and graduate students who wish to gain knowledge of the topics covered as well as an overview of the major accomplishments and proof techniques used in the field.

Download or read book Combinatorial Algorithms written by Leszek Gąsieniec and published by Springer Nature. This book was released on 2020-05-28 with total page 438 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book constitutes the proceedings of the 31st International Workshop on Combinatorial Algorithms which was planned to take place in Bordeaux, France, during June 8–10, 2020. Due to the COVID-19 pandemic the conference changed to a virtual format. The 30 full papers included in this book were carefully reviewed and selected from 62 submissions. They focus on algorithms design for the myriad of combinatorial problems that underlie computer applications in science, engineering and business.

Download or read book Limited Broadcast Domination written by Feiran Yang and published by . This book was released on 2019 with total page pages. Available in PDF, EPUB and Kindle. Book excerpt: Let G = (V,E) be a graph and f be a function such that f : V -> {0,1,2,..., k}. Let V_f^+ = {v : f(v) > 0}. If for every vertex v not in V_f^+ there exists a vertex w in V_f^+ such that d(v,w) ≤ f(w) then f is called a k-limited dominating broadcast of G. The sum of f(v) is called the cost of the broadcast. The minimum cost of a dominating broadcast is called the k-limited broadcast domination number of G, and is denoted by gamma_{b,k}(G). This parameter gamma_{b,k}(G) is a variation of the well-studied broadcast domination number. The value gamma_{b,k}(G) can also be defined as a solution to an integer linear programming problem. The solution to the dual problem is defined as the k-limited multipacking number. We begin with a survey of known results and background related to these broadcast domination related parameters. In Chapter 3, we give a proof of NP-completeness for the problem of determining the k-limited broadcast domination number for a fixed graph G, as well as a proof of NP-completeness for its dual problem of determining the k-limited multipacking number. Chapter 4 focuses on cubic and subcubic graphs. Here we give an upper bound for the 2-limited broadcast domination number of (C_4, C_6)-free cubic graphs. In Chapter 5, we describe algorithms which determine the k-limited broadcast domination number for strongly chordal graphs, interval graphs, circular arc graphs and proper interval bigraphs in polynomial time. In Chapter 6, we show that the k-limited broadcast domination number for trees can be determined in linear time. We specifically give a linear time algorithm which determines the 2-limited broadcast domination number of trees.

Download or read book Graph Theoretic Concepts in Computer Science written by Dieter Kratsch and published by Springer. This book was released on 2005-12-06 with total page 481 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book constitutes the thoroughly refereed post-proceedings of the 31st International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2005, held in Metz, France in June 2005. The 38 revised full papers presented together with 2 invited papers were carefully selected from 125 submissions. The papers provide a wealth of new results for various classes of graphs, graph computations, graph algorithms, and graph-theoretical applications in various fields. The workshop aims at uniting theory and practice by demonstrating how graph-theoretic concepts can be applied to various areas in Computer Science, or by extracting new problems from applications. The goal is to present recent research results and to identify and explore directions of future research.

Download or read book Congressus Numerantium written by and published by . This book was released on 2000 with total page 464 pages. Available in PDF, EPUB and Kindle. Book excerpt:

Download or read book Parallel Algorithms for Series Parallel Graphs written by Hans Leo Bodlaender and published by . This book was released on 1996 with total page 22 pages. Available in PDF, EPUB and Kindle. Book excerpt: Abstract: "In this paper, a parallel algorithm is given that, given a graph G = (V, E), decides whether G is a series parallel graph, and if so, builds a decomposition tree for G of series and parallel composition rules. The algorithm uses O(log[absolute value of E]log*[absolute value of E]) time and O([absolute value of E]) operations on an EREW PRAM, and O(log [absolute value of E]) time and O([absolute value of E]) operations on a CRCW PRAM (note that if G is a simple series parallel graph, then [absolute value of E] = O([absolute value of V]). With the same time and processor resources, a tree-decomposition of width at most two can be built of a given series parallel graph, and hence, very efficient parallel algorithms can be found for a large number of graph problems on series parallel graphs, including many well known problems, e.g., all problems that can be stated in monadic second order logic. The results hold for undirected series parallel graphs graphs [sic], as well as for directed series parallel graphs."

Download or read book Ars Combinatoria written by and published by . This book was released on 2008 with total page 870 pages. Available in PDF, EPUB and Kindle. Book excerpt:

Download or read book Graph Theoretic Concepts in Computer Science written by Ulrik Brandes and published by Springer Science & Business Media. This book was released on 2000-10-18 with total page 332 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book constitutes the thoroughly refereed post-workshop proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2000, held in Konstanz, Germany, in June 2000. The 26 revised full papers presented together with two invited contributions were carefully reviewed and selected from 51 submissions. The papers provide a wealth of new results for various classes of graphs, graph computations, graph algorithms and graph-theoretical applications in various fields.

Download or read book Graph Theoretic Concepts in Computer Science written by Ernst W. Mayr and published by Springer Science & Business Media. This book was released on 1995-03-17 with total page 422 pages. Available in PDF, EPUB and Kindle. Book excerpt: This volume presents the proceedings of the 20th International Workshop on Graph-Theoretic Concepts in Computer Science (WG '94), held in Herrsching, Germany in June 1994. The volume contains 32 thoroughly revised papers selected from 66 submissions and provides an up-to-date snapshot of the research performed in the field. The topics addressed are graph grammars, treewidth, special graph classes, algorithms on graphs, broadcasting and architecture, planar graphs and related problems, and special graph problems.

Download or read book Parallel Algorithms for Maximum Matching and Other Problems on Interval Graphs written by Cornell University. Department of Computer Science and published by . This book was released on 1988 with total page 19 pages. Available in PDF, EPUB and Kindle. Book excerpt: In this paper, we consider parallel algorithms on interval graphs. An interval graph is a graph having a one-to-one correspondence with a sequence of intervals on the real line, such that each vertex maps to an interval in the sequence and an edge exists between two vertices if and only if the corresponding intervals overlap. Throughout the paper we use the CREW PRAM model. Our main result is an $O(\log[superscript]{2} n)$ time, $O(n[superscript]{6}/\log n)$ processor algorithm for maximum matching on interval graphs. We give PT-optimal algorithms for maximum weighted clique, maximum independent set, minimum clique cover, and minimum dominating set for representations of interval graphs; and Hamiltonian circuit for representations of proper interval graphs. We also give an improved algorithm for minimum bandwidth on representations of proper interval graphs. In addition, we present $O (\log n)$ time, $O (n[superscript]{2}/\log n)$ processor algorithms for depth-first search on representations of interval graphs and maximum matching on representations of proper interval graphs.

Download or read book Efficient Parallel Algorithms on Chordal Graphs with a Sparse Tree Representation written by Elias Dahlhaus and published by . This book was released on 1993 with total page 18 pages. Available in PDF, EPUB and Kindle. Book excerpt: Abstract: "Chordal graphs are nothing else than intersection graphs of subtrees of a tree. We present nearly optimal algorithms for certain graph problems if the input graph is given by a collection of subtrees of a tree and the subtrees are given by their leaves. This generalizes results of Olariu, Schwing, and Zhang [12] concerning the parallel complexity of problems on interval graphs provided the interval structure is given."

Download or read book Graph theoretic Concepts in Computer Science written by and published by . This book was released on 2005 with total page 500 pages. Available in PDF, EPUB and Kindle. Book excerpt:

Download or read book Design and Implementation of Parallel Graph Algorithms for Minimum Spanning Tree List Ranking and Root Finding on Trees written by Sun B. Chung and published by . This book was released on 1998 with total page 294 pages. Available in PDF, EPUB and Kindle. Book excerpt:

Download or read book Algorithms for Deterministic Parallel Graph Exploration written by Dominik Pajak and published by . This book was released on 2014 with total page 0 pages. Available in PDF, EPUB and Kindle. Book excerpt: In this thesis we study the problem of parallel graph exploration using multiple synchronized mobile agents. Each mobile agent is an entity that can, independently of other agents, visit vertices of the graph and traverse its edges. The goal of the agents is to visit all vertices of the graph. We first study graph exploration in the model where agents are equipped with internal memory but no memory is available at the nodes. Agents in this model are also allowed to communicate between each other by exchanging messages. We present algorithms working in a minimal possible time for a team of polynomial size (in the number of vertices of the graph). We also study the impact of the available range of communication by analysing algorithms for agents which can communicate at arbitrary distance, or only with other agents located at the same node. We present efficient algorithms and lower bounds that almost match our positive results in both communication models. We also consider graph exploration when movements of agents are determined according to the so-called rotor-router mechanism. From the perspective of a fixed node, the rotor-router sends out agents which visit the node along its outgoing edges, ina round-robin fashion. We study the speedup which is the ratio between the worst-case exploration of a single agent and of multiple agents. We first show that the speed up for general graphs for the multi-agent rotor-router is always between logarithmic and linear in the number of agents. We also present a tight analysis of the speedup for the multi-agent rotor-router for cycles, expanders, random graphs, cliques, constant dimensional tori and an almost-tight analysis for hypercubes. Finally we consider collision-free exploration, where each agent has to explore the graph independently with the additional constraint that no two agents can occupy the same node at the same time. In the case when agents are given the map of the graph, we show an optimal algorithm for trees and an asymptotically optimal algorithm for general graphs. We also present algorithms for collision-free exploration of trees and general graphs in the case when agents have no initial knowledge about the graph. We close the thesis with concluding remarks and a discussion of related open problems in the area of graph exploration.

Download or read book Graph theoretic Concepts in Computer Science written by and published by . This book was released on 2000 with total page 340 pages. Available in PDF, EPUB and Kindle. Book excerpt:

Download or read book Graph Theory Notes of New York written by and published by . This book was released on 2004 with total page 316 pages. Available in PDF, EPUB and Kindle. Book excerpt: