Towards Random Uniform Sampling of Bipartite Graphs With Given Degree Sequence

Electronic Journal of Combinatorics - United States
doi 10.37236/3028
Full Text
Abstract

Available in full text

Date
Authors
Publisher

The Electronic Journal of Combinatorics

Related search

Giant Component in Random Multipartite Graphs With Given Degree Sequences

Stochastic Systems
2015English

The Number of Spanning Trees in Graphs With a Given Degree Sequence

Random Structures and Algorithms
MathematicsApplied MathematicsComputer GraphicsComputer-Aided DesignSoftware
1995English

The Degree Sequence of Random Graphs From Subcritical Classes

Combinatorics Probability and Computing
StatisticsProbabilityApplied MathematicsMathematicsComputational TheoryTheoretical Computer Science
2009English

Efficiently Sampling the Realizations of Bounded, Irregular Degree Sequences of Bipartite and Directed Graphs

PLoS ONE
Multidisciplinary
2018English

Generating Maximally Disassortative Graphs With Given Degree Distribution

Stochastic Systems
2018English

Optimal Pebbling Number of Graphs With Given Minimum Degree

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2019English

The Size of the Giant Component of a Random Graph With a Given Degree Sequence

Combinatorics Probability and Computing
StatisticsProbabilityApplied MathematicsMathematicsComputational TheoryTheoretical Computer Science
1998English

Degree-Degree Dependencies in Random Graphs With Heavy-Tailed Degrees

Internet Mathematics
Computational MathematicsApplied MathematicsSimulationModeling
2014English

The Degree/Diameter Problem in Maximal Planar Bipartite Graphs

Electronic Journal of Combinatorics
CombinatoricsApplied MathematicsMathematicsGeometryDiscrete MathematicsComputational TheoryTopologyTheoretical Computer Science
2016English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy