The complexity of Boolean matrix root computation
Theoretical Computer Science - Special papers from: COCOON 2003
Finding next-to-shortest paths in a graph
Information Processing Letters
On querying OBO ontologies using a DAG pattern query language
DILS'06 Proceedings of the Third international conference on Data Integration in the Life Sciences
FPT algorithms for connected feedback vertex set
WALCOM'10 Proceedings of the 4th international conference on Algorithms and Computation
On the directed Full Degree Spanning Tree problem
Discrete Optimization
Comprehensive rule-based compliance checking and risk management with process mining
Decision Support Systems
On the number of update digraphs and its relation with the feedback arc sets and tournaments
Discrete Applied Mathematics
Note: Hamiltonicity of large generalized de Bruijn cycles
Discrete Applied Mathematics
International Journal of Information Technology and Web Engineering
Complexity-sensitive decision procedures for abstract argumentation
Artificial Intelligence
An ILP-refined tabu search for the Directed Profitable Rural Postman Problem
Discrete Applied Mathematics
Derivation digraphs for dependencies in ordinal and similarity-based data
Information Sciences: an International Journal
| Hi-index | 0.00 |
Substantially revised, reorganised and updated, the second editionnow comprises eighteen chapters, carefully arranged in a straightforward and logical manner, with many new results and open problems. As well as covering the theoretical aspects of the subject, with detailed proofs of many important results, the authors present a number of algorithms, and whole chapters are devoted to topics such as branchings, feedback arc and vertex sets, connectivity augmentations, sparse subdigraphs with prescribed connectivity, and also packing, covering and decompositions of digraphs. Throughout the book, there is a strong focus on applications which include quantum mechanics, bioinformatics, embedded computing, and the travelling salesman problem. Detailed indices and topic-oriented chapters ease navigation, and more than 650 exercises, 170 figures and 150 open problems are included to help immerse the reader in all aspects of the subject.