Author: Jean R. S. Blair
Publisher:
ISBN:
Category :
Languages : en
Pages : 48
Book Description
Broadcast Domination Algorithms for Interval Graphs, Series-parallel Graphs, and Trees
Author: Jean R. S. Blair
Publisher:
ISBN:
Category :
Languages : en
Pages : 48
Book Description
Publisher:
ISBN:
Category :
Languages : en
Pages : 48
Book Description
Structures of Domination in Graphs
Author: Teresa W. Haynes
Publisher: Springer Nature
ISBN: 3030588920
Category : Mathematics
Languages : en
Pages : 536
Book Description
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.
Publisher: Springer Nature
ISBN: 3030588920
Category : Mathematics
Languages : en
Pages : 536
Book Description
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.
Combinatorial Algorithms
Author: Leszek Gąsieniec
Publisher: Springer Nature
ISBN: 3030489663
Category : Computers
Languages : en
Pages : 438
Book Description
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.
Publisher: Springer Nature
ISBN: 3030489663
Category : Computers
Languages : en
Pages : 438
Book Description
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.
Graph-Theoretic Concepts in Computer Science
Author: Dieter Kratsch
Publisher: Springer Science & Business Media
ISBN: 3540310002
Category : Computers
Languages : en
Pages : 481
Book Description
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.
Publisher: Springer Science & Business Media
ISBN: 3540310002
Category : Computers
Languages : en
Pages : 481
Book Description
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.
Congressus Numerantium
Author:
Publisher:
ISBN:
Category : Combinatorial analysis
Languages : en
Pages : 464
Book Description
Publisher:
ISBN:
Category : Combinatorial analysis
Languages : en
Pages : 464
Book Description
Ars Combinatoria
Author:
Publisher:
ISBN:
Category : Combinatorial analysis
Languages : en
Pages : 870
Book Description
Publisher:
ISBN:
Category : Combinatorial analysis
Languages : en
Pages : 870
Book Description
Graph-theoretic Concepts in Computer Science
Author:
Publisher:
ISBN:
Category : Algorithms
Languages : en
Pages : 500
Book Description
Publisher:
ISBN:
Category : Algorithms
Languages : en
Pages : 500
Book Description
Graph Theory Notes of New York
Author:
Publisher:
ISBN:
Category : Graph theory
Languages : en
Pages : 316
Book Description
Publisher:
ISBN:
Category : Graph theory
Languages : en
Pages : 316
Book Description
Mathematical Reviews
Author:
Publisher:
ISBN:
Category : Mathematics
Languages : en
Pages : 1884
Book Description
Publisher:
ISBN:
Category : Mathematics
Languages : en
Pages : 1884
Book Description
Total Domination in Graphs
Author: Michael A. Henning
Publisher: Springer Science & Business Media
ISBN: 1461465257
Category : Mathematics
Languages : en
Pages : 184
Book Description
Total Domination in Graphs gives a clear understanding of this topic to any interested reader who has a modest background in graph theory. This book provides and explores the fundamentals of total domination in graphs. Some of the topics featured include the interplay between total domination in graphs and transversals in hypergraphs, and the association with total domination in graphs and diameter-2-critical graphs. Several proofs are included in this text which enables readers to acquaint themselves with a toolbox of proof techniques and ideas with which to attack open problems in the field. This work is an excellent resource for students interested in beginning their research in this field. Additionally, established researchers will find the book valuable to have as it contains the latest developments and open problems.
Publisher: Springer Science & Business Media
ISBN: 1461465257
Category : Mathematics
Languages : en
Pages : 184
Book Description
Total Domination in Graphs gives a clear understanding of this topic to any interested reader who has a modest background in graph theory. This book provides and explores the fundamentals of total domination in graphs. Some of the topics featured include the interplay between total domination in graphs and transversals in hypergraphs, and the association with total domination in graphs and diameter-2-critical graphs. Several proofs are included in this text which enables readers to acquaint themselves with a toolbox of proof techniques and ideas with which to attack open problems in the field. This work is an excellent resource for students interested in beginning their research in this field. Additionally, established researchers will find the book valuable to have as it contains the latest developments and open problems.