Content deleted Content added
m →Augmenting paths: Task 16: replaced (1×) / removed (0×) deprecated |dead-url= and |deadurl= with |url-status=; |
Citation bot (talk | contribs) m Alter: conference. Add: doi. | You can use this bot yourself. Report bugs here. | Activated by User:Grimes2 | via #UCB_webform |
||
Line 27:
| year = 1965
| pages = 125–130
| doi = 10.6028/jres.069B.013
}}</ref>
As elaborated by [[Alexander Schrijver]], further significance of the result comes from the fact that this was the first polytope whose proof of integrality "does not simply follow just from [[total unimodularity]], and its description was a breakthrough in [[polyhedral combinatorics]]."<ref>{{Cite book|url=https://www.springer.com/us/book/9783540443896|title=Combinatorial Optimization: Polyhedra and Efficiency|last=Schrijver|first=Alexander|date=2003|publisher=Springer-Verlag|isbn=9783540443896|series=Algorithms and Combinatorics|___location=Berlin Heidelberg|language=en}}</ref>
Line 180 ⟶ 181:
| author2 = Vazirani, Vijay
| title = An O(V<sup>1/2</sup>E) algorithm for finding maximum matching in general graphs
| conference = 21st Annual Symposium on Foundations of Computer Science
| year = 1980
| publisher = IEEE Computer Society Press, New York
Line 201 ⟶ 202:
| pages = 43–67
| year = 2009
| doi = 10.1007/s12532-009-0002-8
}}</ref>
==References==
| |||