Journal of Discrete Algorithms
A new parameter for a broadcast algorithm with locally bounded Byzantine faults
Information Processing Letters
Proceedings of the forty-third annual ACM symposium on Theory of computing
Parallel implementations of gusfield's cut tree algorithm
ICA3PP'11 Proceedings of the 11th international conference on Algorithms and architectures for parallel processing - Volume Part I
Submodular minimization via pathwidth
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
An o *(1.84 k) parameterized algorithm for the multiterminal cut problem
FCT'13 Proceedings of the 19th international conference on Fundamentals of Computation Theory
An O*(1.84k) parameterized algorithm for the multiterminal cut problem
Information Processing Letters
Hi-index | 0.00 |
Algorithmic Aspects of Graph Connectivity is the first comprehensive book on this central notion in graph and network theory, emphasizing its algorithmic aspects. Because of its wide applications in the fields of communication, transportation, and production, graph connectivity has made tremendous algorithmic progress under the influence of the theory of complexity and algorithms in modern computer science. The book contains various definitions of connectivity, including edge-connectivity and vertex-connectivity, and their ramifications, as well as related topics such as flows and cuts. The authors comprehensively discuss new concepts and algorithms that allow for quicker and more efficient computing, such as maximum adjacency ordering of vertices. Covering both basic definitions and advanced topics, this book can be used as a textbook in graduate courses in mathematical sciences, such as discrete mathematics, combinatorics, and operations research, and as a reference book for specialists in discrete mathematics and its applications.