Dr Stefan Dantchev s.s.dantchev@durham.ac.uk
Assistant Professor
Combinatorial Axiomatisation of Edge-weighted PageRank
Dantchev, Stefan; Heppenstall, Alan
Authors
Alan Heppenstall
Citation
Dantchev, S., & Heppenstall, A. (in press). Combinatorial Axiomatisation of Edge-weighted PageRank. Internet mathematics,
| Journal Article Type | Article |
|---|---|
| Acceptance Date | May 1, 2016 |
| Deposit Date | Mar 11, 2017 |
| Journal | Internet Mathematics |
| Print ISSN | 1542-7951 |
| Electronic ISSN | 1944-9488 |
| Publisher | Internet mathematics. |
| Peer Reviewed | Peer Reviewed |
| Public URL | https://durham-repository.worktribe.com/output/1383462 |
| Publisher URL | https://www.internetmathematicsjournal.com/ |
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
Downloadable Citations
About Durham Research Online (DRO)
Administrator e-mail: dro.admin@durham.ac.uk
This application uses the following open-source libraries:
SheetJS Community Edition
Apache License Version 2.0 (http://www.apache.org/licenses/)
PDF.js
Apache License Version 2.0 (http://www.apache.org/licenses/)
Font Awesome
SIL OFL 1.1 (http://scripts.sil.org/OFL)
MIT License (http://opensource.org/licenses/mit-license.html)
CC BY 3.0 ( http://creativecommons.org/licenses/by/3.0/)
Powered by Worktribe © 2025
Advanced Search