How to Determine if a Random Graph with a Fixed Degree Sequence Has a Giant Component (2016)

First Author: Joos F
Attributed to:  Randomized approaches to combinatorial packing and covering problems funded by EPSRC

Abstract

No abstract provided

Bibliographic Information

Digital Object Identifier: http://dx.doi.org/10.1109/focs.2016.79

Publication URI: http://dx.doi.org/10.1109/focs.2016.79

Type: Conference/Paper/Proceeding/Abstract