The theory of directed graphs has developed enormously over recent decades, yet this book
(first published in 2000) remains the only book to cover more than a small fraction of the …

Publisher Summary Matching is pairing: dividing a collection of objects into pairs. Typically
the objective is to maximize total profit (or minimize cost), where the profit of each possible …

Abstract Many real-life Constraint Satisfaction Problems (CSPs) involve some constraints
similar to the alldifferent constraints. These constraints are called constraints of difference …

The maximum cardinality and maximum weight matching problems can be solved in Õ (m√
n) time, a bound that has resisted improvement despite decades of research.(Here m and n …

We present an Õ (m 10/7)= Õ (m 1.43)-time 1 algorithm for the maximum st flow and the
minimum st cut problems in directed graphs with unit capacities. This is the first improvement …

Leda, the Library of Efficient Data Types and Algorithms, aims at being a comprehensive
software platform for the area of combinatorial and geometric computing. It provides a …

Linear Assignment Problems and Extensions | SpringerLink Skip to main content Advertisement
SpringerLink Account Menu Find a journal Publish with us Track your research Search Cart …

The notion of graph which is most useful in computer science is that of a directed graph or
just a graph. A graph is a combinatorial structure consisting of a finite nonempty set of …

Integrated Methods for Optimization will be used as a textbook in Optimization courses. It is a
well written book—John Hooker is an excellent expositor—and it will contain the appropriate …

We present an Õ (m 7/10 U 1/7)-time algorithm for the maximum st flow problem (and the
minimum st cut problem) in directed graphs with m arcs and largest integer capacity U. This …