SU\G(𝔸)/K·U

Brandon Sit

Follow

Generating author description...

All published works
Action Title Year Authors
+ PDF Chat Fairest edge usage and minimum expected overlap for random spanning trees 2021 Nathan Albin
Jason Clemens
Derek O'Keeffe Hoare
Pietro Poggi‐Corradini
Brandon Sit
Sarah Tymochko
Common Coauthors
Coauthor Papers Together
Jason Clemens 1
Derek O'Keeffe Hoare 1
Nathan Albin 1
Pietro Poggi‐Corradini 1
Sarah Tymochko 1
Commonly Cited References
Action Title Year Authors # of times referenced
+ PDF Chat Modulus of families of walks on graphs 2017 Nathan Albin
Faryad Darabi Sahneh
Max Goering
Pietro Poggi‐Corradini
 1
+ On the spanning tree polyhedron 1989 Sunil Chopra
 1
+ A numerically stable dual method for solving strictly convex quadratic programs 1983 Donald Goldfarb
A. Idnani
 1
+ Threshold Functions for <i>H</i>-factors 1993 Noga Alon
Raphael Yuster
 1
+ PDF Chat Minimal subfamilies and the probabilistic interpretation for modulus on graphs 2016 Nathan Albin
Pietro Poggi‐Corradini
 1
+ PDF Chat Large-scale structures in random graphs 2017 Julia BĂśttcher
 1
+ PDF Chat Blocking duality for p-modulus on networks and applications 2018 Nathan Albin
Jason Clemens
Nethali Fernando
Pietro Poggi‐Corradini
 1