Abstract
In this appendix, we develop some basic machinery which allows us to begin work in topological graph theory, an area where the emphasis is on connectivity and “shape”.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
C. Berge, Two theorems in graph theory. Proc. Natl. Acad. Sci. USA 43(9), 842–844 (1957)
J. Edmonds, Paths, trees and flowers. Can. J. Math. 17, 449–467 (1965)
H. Gabow, M. Stallmann, An augmenting path algorithm for linear matroid parity. Combinatorica 6(2), 123–150 (1986)
L. Lovász, Matroid matching and some applications. J. Comb. Theory, Ser. B 28, 208–236 (1980)
L. Lovász, The matroid matching problem, in Algebraic Methods in Graph Theory, Vol. II (Colloquium Szeged, 1978), ed. by L. Lovász, V. Sós. Colloquia Mathematica Societatis János Bolyai, vol. 25 (North-Holland, Amsterdam, 1981), pp. 495–517
S. Micali, V. Vazirani, An \(O(\sqrt{|v|}|E|)\) algorithm for finding maximum matching in general graphs, in Proceedings of 21st Annual Symposium on Foundations of Computer Science, FOCS 1980, Syracuse, New York, USA, 13–15 October 1980 (IEEE Comput. Soc., Los Alamitos, 1980), pp. 17–27
J. Orlin, A fast, simpler algorithm for the matroid parity problem, in IPCO’08, Proceedings of the 13th International Conference on Integer Programming and Combinatorial Optimization (Springer, Berlin, 2008), pp. 240–258
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag London
About this chapter
Cite this chapter
Downey, R.G., Fellows, M.R. (2013). Appendix 1: Network Flows and Matchings. In: Fundamentals of Parameterized Complexity. Texts in Computer Science. Springer, London. https://doi.org/10.1007/978-1-4471-5559-1_34
Download citation
DOI: https://doi.org/10.1007/978-1-4471-5559-1_34
Publisher Name: Springer, London
Print ISBN: 978-1-4471-5558-4
Online ISBN: 978-1-4471-5559-1
eBook Packages: Computer ScienceComputer Science (R0)