The following pages link to Degree-based graph construction (Q3650407):
Displaying 16 items.
- On fractional realizations of graph degree sequences (Q405210) (← links)
- On realizations of a joint degree matrix (Q479053) (← links)
- Rejection sampling of bipartite graphs with given degree sequence (Q1737401) (← links)
- On partial sorting in restricted rounds (Q2013879) (← links)
- An algebraic Monte-Carlo algorithm for the partition adjacency matrix realization problem (Q2076286) (← links)
- Relaxed and approximate graph realizations (Q2115836) (← links)
- Global dynamics of an epidemic model with incomplete recovery in a complex network (Q2181351) (← links)
- Graph realizations constrained by skeleton graphs (Q2363110) (← links)
- A survey of discrete methods in (algebraic) statistics for networks (Q2979659) (← links)
- New Classes of Degree Sequences with Fast Mixing Swap Markov Chain Sampling (Q4643313) (← links)
- On the Swap-Distances of Different Realizations of a Graphical Degree Sequence (Q4921567) (← links)
- Constructing and sampling directed graphs with given degree sequences (Q5137614) (← links)
- Exact sampling of graphs with prescribed degree correlations (Q5151598) (← links)
- A Decomposition Based Proof for Fast Mixing of a Markov Chain over Balanced Realizations of a Joint Degree Matrix (Q5251622) (← links)
- Graph realizations: maximum degree in vertex neighborhoods (Q6098074) (← links)
- Methods for the graph realization problem (Q6152848) (← links)
