Second best temporally repeated flows
The Korean Journal of Computational & Applied Mathematics
A Hybrid GA for the Edge-Biconnectivity Augmentation Problem
PPSN VI Proceedings of the 6th International Conference on Parallel Problem Solving from Nature
An Investigation of Graph-Based Class Integration Test Order Strategies
IEEE Transactions on Software Engineering
Discovering branching and fractional dependencies in databases
Data & Knowledge Engineering
On the reducibility of compartmental matrices
Computers in Biology and Medicine
Towards a Systematic Method for Identifying Business Components
CBSE '08 Proceedings of the 11th International Symposium on Component-Based Software Engineering
Efficient reasoning about a robust XML key fragment
ACM Transactions on Database Systems (TODS)
Boolean Constraints for XML Modeling
Proceedings of the 2009 conference on Information Modelling and Knowledge Bases XX
Randomized shortest-path problems: Two related models
Neural Computation
Global optimization for first order Markov Random Fields with submodular priors
Discrete Applied Mathematics
Improved algorithm for minimum flows in bipartite networks with unit capacities
WSEAS Transactions on Computers
Parallel programming with object assemblies
Proceedings of the 24th ACM SIGPLAN conference on Object oriented programming systems languages and applications
Parameterized complexity of candidate control in elections and related digraph problems
Theoretical Computer Science
Compact representation of multimedia files for indexing, classification and retrieval
Proceedings of the International Conference on Management of Emergent Digital EcoSystems
Automatica (Journal of IFAC)
Destructive Rule-Based Properties and First-Order Logic
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
Visualizing social network concepts
Decision Support Systems
Compatibility between optimal tree-based broadcast routing and metric design
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
A simple algorithm for triconnectivity of a multigraph
CATS '09 Proceedings of the Fifteenth Australasian Symposium on Computing: The Australasian Theory - Volume 94
WSEAS Transactions on Computers
PABTEC: passivity-preserving balanced truncation for electrical circuits
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
IEEE Transactions on Neural Networks
A max-flow/min-cut algorithm for a class of wireless networks
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Frequent tree pattern mining: A survey
Intelligent Data Analysis
Evaluation of an automated OSPF area design utilty for wireless battlefield networks
MILCOM'06 Proceedings of the 2006 IEEE conference on Military communications
Proceedings of the 2011 ACM Symposium on Applied Computing
The maximum flow problem with minimum lot sizes
ICCL'11 Proceedings of the Second international conference on Computational logistics
Proceedings of the 2011 ACM international conference on Object oriented programming systems languages and applications
ICDT'07 Proceedings of the 11th international conference on Database Theory
Evaluation of strategic supply networks
OTM'05 Proceedings of the 2005 OTM Confederated international conference on On the Move to Meaningful Internet Systems
On finding acyclic subhypergraphs
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
On the existence of armstrong data trees for XML functional dependencies
FoIKS'10 Proceedings of the 6th international conference on Foundations of Information and Knowledge Systems
Convergence of Distributed Asynchronous Learning Vector Quantization Algorithms
The Journal of Machine Learning Research
On traffic domination in communication networks
PERFORM'10 Proceedings of the 2010 IFIP WG 6.3/7.3 international conference on Performance Evaluation of Computer and Communication Systems: milestones and future challenges
DBSMOTE: Density-Based Synthetic Minority Over-sampling TEchnique
Applied Intelligence
A novel 3D NoC architecture based on De Bruijn graph
Computers and Electrical Engineering
Similarity measure models and algorithms for hierarchical cases
Expert Systems with Applications: An International Journal
Image segmentation using fuzzy logic, neural networks and genetic algorithms: survey and trends
Machine Graphics & Vision International Journal
A software tool dedicated to the modelling of landscape networks
Environmental Modelling & Software
Functional unit maps for data-driven visualization of high-density EEG coherence
EUROVIS'07 Proceedings of the 9th Joint Eurographics / IEEE VGTC conference on Visualization
A Label Correcting Algorithm for the Bus Routing Problem
Fundamenta Informaticae
Analysis of strategy in robot soccer game
Neurocomputing
On the load balancing of virtual networks in distributed clouds
Proceedings of the 28th Annual ACM Symposium on Applied Computing
Robust estimation of location and scatter by pruning the minimum spanning tree
Journal of Multivariate Analysis
Efficiency frontiers of XML cardinality constraints
Data & Knowledge Engineering
Hi-index | 0.00 |
From reviews of the previous editions .... The book is a first class textbook and seems to be indispensable for everybody who has to teach combinatorial optimization. It is very helpful for students, teachers, and researchers in this area. The author finds a striking synthesis of nice and interesting mathematical results and practical applications. ... the author pays much attention to the inclusion of well-chosen exercises. The reader does not remain helpless; solutions or at least hints are given in the appendix. Except for some small basic mathematical and algorithmic knowledge the book is self-contained. ... (K. Engel, Mathematical Reviews (2002) The substantial development effort of this text, involving multiple editions and trailing in the context of various workshops, university courses and seminar series, clearly shows through in this new edition with its clear writing, good organisation, comprehensive coverage of essential theory, and well-chosen applications. The proofs of important results and the representation of key algorithms in a Pascal-like notation allow this book to be used in a high-level undergraduate or low-level graduate course on graph theory, combinatorial optimization or computer science algorithms. The well-worked solutions to exercises are a real bonus for self study by students. The book is highly recommended. (P.B. Gibbons, Zentralblatt fr Mathematik 1061, 2005) The third edition of this standard textbook contains additional material: two new application sections (on graphical codes and their decoding) and about two dozen further exercises (with solutions, as throughout the text). Moreover, recent developments have been discussed and referenced, in particular for the travelling salesman problem. The presentation has been improved in many places (for instance, in the chapters on shortest paths and on colorings), and a number of proofs have been reorganized, making them more precise or more transparent.