Book•
Fundamentals of domination in graphs
01 Jan 1998-
TL;DR: Bounds on the domination number domination, independence and irredundance efficiency, redundancy and the duals changing and unchanging domination conditions on the dominating set varieties of domination multiproperty and multiset parameters sums and products of parameters dominating functions frameworks for domination domination complexity and algorithms are presented.
Abstract: Bounds on the domination number domination, independence and irredundance efficiency, redundancy and the duals changing and unchanging domination conditions on the dominating set varieties of domination multiproperty and multiset parameters sums and products of parameters dominating functions frameworks for domination domination complexity and algorithms.
Citations
More filters
Book•
01 Jan 2006
TL;DR: This paper discusses Fixed-Parameter Algorithms, Parameterized Complexity Theory, and Selected Case Studies, and some of the techniques used in this work.
Abstract: PART I: FOUNDATIONS 1. Introduction to Fixed-Parameter Algorithms 2. Preliminaries and Agreements 3. Parameterized Complexity Theory - A Primer 4. Vertex Cover - An Illustrative Example 5. The Art of Problem Parameterization 6. Summary and Concluding Remarks PART II: ALGORITHMIC METHODS 7. Data Reduction and Problem Kernels 8. Depth-Bounded Search Trees 9. Dynamic Programming 10. Tree Decompositions of Graphs 11. Further Advanced Techniques 12. Summary and Concluding Remarks PART III: SOME THEORY, SOME CASE STUDIES 13. Parameterized Complexity Theory 14. Connections to Approximation Algorithms 15. Selected Case Studies 16. Zukunftsmusik References Index
1,730 citations
TL;DR: In this paper, the state-of-the-art algorithms for vital node identification in real networks are reviewed and compared, and extensive empirical analyses are provided to compare well-known methods on disparate real networks.
919 citations
Book•
31 Jan 2002
TL;DR: This book provides the most basic problems, concepts, and well-established results from the topological structure and analysis of interconnection networks in the graph-theoretic language for undergraduates and postgraduates specializing in computer science and applied mathematics.
Abstract: This book provides the most basic problems, concepts, and well-established results from the topological structure and analysis of interconnection networks in the graph-theoretic language. It covers the basic principles and methods of network design, several well-known networks such as hypercubes, de Bruijn digraphs, Kautz digraphs, double loop, and other networks, and the newest parameters to measure performance of fault-tolerant networks such as Menger number, Rabin number, fault-tolerant diameter, wide-diameter, restricted connectivity, and (l,w)-dominating number. Audience: The book is suitable for those readers who are working on or intend to start research in design analysis of the topological structure of interconnection networks, particularly undergraduates and postgraduates specializing in computer science and applied mathematics.
625 citations
TL;DR: This review clarifies the concepts and metrics, classify the problems and methods, as well as review the important progresses and describe the state of the art, and provides extensive empirical analyses to compare well-known methods on disparate real networks and highlight the future directions.
Abstract: Real networks exhibit heterogeneous nature with nodes playing far different roles in structure and function. To identify vital nodes is thus very significant, allowing us to control the outbreak of epidemics, to conduct advertisements for e-commercial products, to predict popular scientific publications, and so on. The vital nodes identification attracts increasing attentions from both computer science and physical societies, with algorithms ranging from simply counting the immediate neighbors to complicated machine learning and message passing approaches. In this review, we clarify the concepts and metrics, classify the problems and methods, as well as review the important progresses and describe the state of the art. Furthermore, we provide extensive empirical analyses to compare well-known methods on disparate real networks, and highlight the future directions. In despite of the emphasis on physics-rooted approaches, the unification of the language and comparison with cross-domain methods would trigger interdisciplinary solutions in the near future.
542 citations
Cites background from "Fundamentals of domination in graph..."
..., the network efficiency defined as the mean value of the inverses of the shortest distances of all node pairs [71] and the coverage of a set of nodes defined as the number of nodes belonging to the set itself or neighboring to at least one node in the set [198,199]) and more dynamical processes (e....
[...]
...For example, the minimum dominating set (MDS) problem aims at constructing a node set of the smallest size such that any node of the network is either in this set or is adjacent to at least one node of this set [198,199], and the MDS or a subset of MDS can be considered as an approximate solution of the IMP....
[...]
01 Feb 2002
TL;DR: H Handbook of Internet Computing pdf eBook copy write by good Handbook of Wireless Networks and Mobile Computing Google Books.
Abstract: If you want to get Handbook of Internet Computing pdf eBook copy write by good Handbook of Wireless Networks and Mobile Computing Google Books. Mobile Computing General. Handbook of Algorithms for Wireless Networking and Mobile Computing by Azzedine Boukerche (Editor). Call Number: TK 5103.2. CITS4419 Mobile and Wireless Computing software projects related to wireless networks, (2) write technical reports and documentation for complex computer.
532 citations