Searching for authors named "Alexander Schrijver" – sorted by Relevance.
-
Paths and Flows - a Historical Survey
- Paths and Flows---a Historical Survey Alexander Schrijver CWI Kruislaan 413, 1098 SJ Amsterdam
- Add To MetaCart
-
Routing and Timetabling by Topological Search
- Doc. Math. J. DMV 687 Routing and Timetabling by Topological Search Alexander Schrijver Abstract
- Add To MetaCart
-
On the History of the Transportation and Maximum Flow Problems
- On the history of the transportation and maximum flow problems Alexander Schrijver 1 Abstract. We
- Add To MetaCart
-
Flows, Paths, and Transportation
- this paper.) Alternative proofs of the max-flow min-cut theorem were given by Robacker [23] and by Elias, Feinstein, and Shannon [7]. In this last paper it is claimed that the result was known by workers in communication theory: 13 This theorem may appear almost obvious on physical grounds and app
- Add To MetaCart
-
Advanced Graph Theory and Combinatorial Optimization
- Contents 1. Shortest trees and branchings 3 1.1. Minimum spanning trees 3 1.2. Finding optimum branchings 5 2. Matchings and covers 7 2.1. Matchings, covers, and Gallai's theorem 7 2.2. Konig's theorems 8 2.3. Tutte's 1-factor theorem and the Tutte-Berge formula 9 3. Edge-colouring 12 3.1.
- Add To MetaCart
-
Strong t-perfection of bad-K_4-free graphs
- Strong t-perfection of bad-K 4 -free graphs Alexander Schrijver 1 Abstract. We show that each
- Cited by 1 (0 self) – Add To MetaCart
-
A short proof of Guenin's characterization of weakly bipartite graphs
- A short proof of Guenin's characterization of weakly bipartite graphs Alexander Schrijver 1
- Cited by 3 (0 self) – Add To MetaCart
-
Minimum Circulation of Railway Stock
- Minimum Circulation of Railway Stock Alexander Schrijver CWI, Kruislaan 413, 1098 SJ Amsterdam
- Cited by 7 (1 self) – Add To MetaCart
-
Bipartite edge-colouring in O(Δm) time
- Bipartite edge-colouring in O(\Deltam) time 1 Alexander Schrijver 2 Abstract. We show that a
- Cited by 1 (0 self) – Add To MetaCart
-
A Group-Theoretical Approach to Disjoint Paths in Directed Graphs
- A Group-Theoretical Approach to Disjoint Paths in Directed Graphs Alexander Schrijver CWI
- Cited by 1 (0 self) – Add To MetaCart

