Connected Dominating Set: Theory and Applications

Connected Dominating Set: Theory and Applications PDF Author: Ding-Zhu Du
Publisher: Springer Science & Business Media
ISBN: 1461452422
Category : Business & Economics
Languages : en
Pages : 206

Get Book Here

Book Description
The connected dominating set has been a classic subject studied in graph theory since 1975. Since the 1990s, it has been found to have important applications in communication networks, especially in wireless networks, as a virtual backbone. Motivated from those applications, many papers have been published in the literature during last 15 years. Now, the connected dominating set has become a hot research topic in computer science. In this book, we are going to collect recent developments on the connected dominating set, which presents the state of the art in the study of connected dominating sets. The book consists of 16 chapters. Except the 1st one, each chapter is devoted to one problem, and consists of three parts, motivation and overview, problem complexity analysis, and approximation algorithm designs, which will lead the reader to see clearly about the background, formulation, existing important research results, and open problems. Therefore, this would be a very valuable reference book for researchers in computer science and operations research, especially in areas of theoretical computer science, computer communication networks, combinatorial optimization, and discrete mathematics.

Connected Dominating Set: Theory and Applications

Connected Dominating Set: Theory and Applications PDF Author: Ding-Zhu Du
Publisher: Springer Science & Business Media
ISBN: 1461452422
Category : Business & Economics
Languages : en
Pages : 206

Get Book Here

Book Description
The connected dominating set has been a classic subject studied in graph theory since 1975. Since the 1990s, it has been found to have important applications in communication networks, especially in wireless networks, as a virtual backbone. Motivated from those applications, many papers have been published in the literature during last 15 years. Now, the connected dominating set has become a hot research topic in computer science. In this book, we are going to collect recent developments on the connected dominating set, which presents the state of the art in the study of connected dominating sets. The book consists of 16 chapters. Except the 1st one, each chapter is devoted to one problem, and consists of three parts, motivation and overview, problem complexity analysis, and approximation algorithm designs, which will lead the reader to see clearly about the background, formulation, existing important research results, and open problems. Therefore, this would be a very valuable reference book for researchers in computer science and operations research, especially in areas of theoretical computer science, computer communication networks, combinatorial optimization, and discrete mathematics.

Domination in Graphs

Domination in Graphs PDF Author: TeresaW. Haynes
Publisher: Routledge
ISBN: 1351454641
Category : Mathematics
Languages : en
Pages : 519

Get Book Here

Book Description
""Presents the latest in graph domination by leading researchers from around the world-furnishing known results, open research problems, and proof techniques. Maintains standardized terminology and notation throughout for greater accessibility. Covers recent developments in domination in graphs and digraphs, dominating functions, combinatorial problems on chessboards, and more.

Total Domination in Graphs

Total Domination in Graphs PDF Author: Michael A. Henning
Publisher: Springer Science & Business Media
ISBN: 1461465257
Category : Mathematics
Languages : en
Pages : 184

Get Book Here

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.

Algorithms - ESA '96

Algorithms - ESA '96 PDF Author: Josep Díaz
Publisher: Lecture Notes in Computer Science
ISBN:
Category : Computers
Languages : en
Pages : 586

Get Book Here

Book Description
This book constitutes the refereed proceedings of the 4th European Symposium on Algorithms, ESA '96, held in Barcelona, Spain, in September 1996. The book presents 40 revised full papers selected from 124 submissions; also are included extended abstracts of two invited presentations. The papers included cover all research areas on algorithms and their analysis as it is carried out in the fields of computer science, discrete applied and algorithmic mathematics, operations research, and all other areas of algorithms-oriented research, design and analysis.

Topics on Domination

Topics on Domination PDF Author: S.T. Hedetniemi
Publisher: Elsevier
ISBN: 008086788X
Category : Mathematics
Languages : en
Pages : 287

Get Book Here

Book Description
The contributions in this volume are divided into three sections: theoretical, new models and algorithmic. The first section focuses on properties of the standard domination number &ggr;(G), the second section is concerned with new variations on the domination theme, and the third is primarily concerned with finding classes of graphs for which the domination number (and several other domination-related parameters) can be computed in polynomial time.

Fundamentals of Domination in Graphs

Fundamentals of Domination in Graphs PDF Author: Teresa W. Haynes
Publisher: CRC Press
ISBN: 1482246589
Category : Mathematics
Languages : en
Pages : 465

Get Book Here

Book Description
"Provides the first comprehensive treatment of theoretical, algorithmic, and application aspects of domination in graphs-discussing fundamental results and major research accomplishments in an easy-to-understand style. Includes chapters on domination algorithms and NP-completeness as well as frameworks for domination."

Handbook of Research on Advanced Wireless Sensor Network Applications, Protocols, and Architectures

Handbook of Research on Advanced Wireless Sensor Network Applications, Protocols, and Architectures PDF Author: Ray, Niranjan K.
Publisher: IGI Global
ISBN: 1522504877
Category : Technology & Engineering
Languages : en
Pages : 521

Get Book Here

Book Description
The implementation of wireless sensor networks has wide-ranging applications for monitoring various physical and environmental settings. However, certain limitations with these technologies must be addressed in order to effectively utilize them. The Handbook of Research on Advanced Wireless Sensor Network Applications, Protocols, and Architectures is a pivotal reference source for the latest research on recent innovations and developments in the field of wireless sensors. Examining the advantages and challenges presented by the application of these networks in various areas, this book is ideally designed for academics, researchers, students, and IT developers.

Interconnection Networks

Interconnection Networks PDF Author: J.-C. Bermond
Publisher: Elsevier
ISBN: 1483295273
Category : Mathematics
Languages : en
Pages : 590

Get Book Here

Book Description
Most of the articles in this book deal with static or point-to-pointInterconnection Networks. In particular, new constructions are proposed basedon different tools from discrete mathematics. Many new records have beenestablished in the table of the maximum number of vertices of graphs withmaximum degree &Dgr; and diameter D. Properties of thesenetworks (and of more classical ones) are analyzed in many of the otherpapers. About 40% of the articles deal with fault tolerance orvulnerability properties using either combinatorial tools or probabilisticones.

MATHEMATICAL COMBINATORICS (INTERNATIONAL BOOK SERIES)

MATHEMATICAL COMBINATORICS (INTERNATIONAL BOOK SERIES) PDF Author: Linfan MAO
Publisher: Infinite Study
ISBN:
Category : Mathematics
Languages : en
Pages : 135

Get Book Here

Book Description
The mathematical combinatorics is a subject that applying combinatorial notion to all mathematics and all sciences for understanding the reality of things in the universe, motivated by CC Conjecture of Dr.Linfan MAO on mathematical sciences. TheMathematical Combinatorics (International Book Series) is a fully refereed international book series with an ISBN number on each issue, sponsored by the MADIS of Chinese Academy of Sciences and published in USA quarterly, which publishes original research papers and survey articles in all aspects of mathematical combinatorics, Smarandachemulti-spaces, Smarandache geometries, non-Euclidean geometry, topology and their applications to other sciences.

Graph Theory, Combinatorics, and Algorithms

Graph Theory, Combinatorics, and Algorithms PDF Author: Y. Alavi
Publisher:
ISBN:
Category : Algorithms
Languages : en
Pages : 426

Get Book Here

Book Description