Dr Stefan Dantchev s.s.dantchev@durham.ac.uk
Assistant Professor
Sublinear-time algorithms for tournament graphs
Dantchev, Stefan; Friedetzky, Tom; Nagel, Lars
Authors
Dr Tom Friedetzky tom.friedetzky@durham.ac.uk
Associate Professor
Lars Nagel
Citation
Dantchev, S., Friedetzky, T., & Nagel, L. (2011). Sublinear-time algorithms for tournament graphs. Journal of Combinatorial Optimization, 22, 469–481. https://doi.org/10.1007/s10878-010-9325-7
| Journal Article Type | Article |
|---|---|
| Acceptance Date | Mar 30, 2010 |
| Online Publication Date | Apr 30, 2010 |
| Publication Date | 2011-10 |
| Deposit Date | Nov 29, 2012 |
| Journal | Journal of Combinatorial Optimization |
| Print ISSN | 1382-6905 |
| Electronic ISSN | 1573-2886 |
| Publisher | Springer |
| Peer Reviewed | Peer Reviewed |
| Volume | 22 |
| Pages | 469–481 |
| DOI | https://doi.org/10.1007/s10878-010-9325-7 |
| Public URL | https://durham-repository.worktribe.com/output/1470486 |
You might also like
Depth lower bounds in Stabbing Planes for combinatorial principles
(2024)
Journal Article
Relativization makes contradictions harder for Resolution
(2013)
Journal Article
Rank complexity gap for Lovász-Schrijver and Sherali-Adams proof systems
(2012)
Journal Article
Cutting Planes and the Parameter Cutwidth
(2012)
Journal Article
Parameterized Proof Complexity
(2011)
Journal Article