SCOPUS 정보 검색 플랫폼

Volumn 20, Issue 1, 2013, Pages

Towards random uniform sampling of bipartite graphs with given degree sequence

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84873391213 PISSN: None EISSN: 10778926 Source Type: Journal
DOI: 10.37236/3028 Document Type: Article

Times cited : (47)

References (14)

1
- 85012603843
- A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
- Bollobás, B.: A probabilistic proof of an asymptotic formula for the number of labelled regular graphs. European J. Comb. 1 (1980), 311-316.
- (1980) European J. Comb. , vol.1 , pp. 311-316
- Bollobás, B.¹

2
- 34250011498
- Sampling regular graphs and a peer-to-peer network
- Cooper, C.-Dyer, M.-Greenhill, C.: Sampling regular graphs and a peer-to-peer network, Comb. Prob. Comp. 16 (4) (2007), 557-593.
- (2007) Comb. Prob. Comp. , vol.16 , Issue.4 , pp. 557-593
- Cooper, C.¹ Dyer, M.² Greenhill, C.³

4
- 84873365699
- manuscript
- Erdo{double acute}s, Péter L.-Király, Z.-Miklós, I.: On graphical degree sequences and realiza-tions, manuscript (2012).
- (2012) On graphical degree sequences and realiza-tions
- Erdos, P.L.¹ Király, Z.² Miklós, I.³

5
- 0000224828
- On the realizability of a set of integers as degrees of the vertices of a simple graph
- Hakimi, S.L.: On the realizability of a set of integers as degrees of the vertices of a simple graph. J. SIAM Appl. Math. 10 (1962), 496-506.
- (1962) J. SIAM Appl. Math. , vol.10 , pp. 496-506
- Hakimi, S.L.¹

6
- 0013357555
- A remark on the existence of ńite graphs. (in Czech)
- Havel, V.: A remark on the existence of ńite graphs. (in Czech), Časopis Pést. Mat. 80 (1955), 477-480.
- (1955) Časopis Pést. Mat. , vol.80 , pp. 477-480
- Havel, V.¹

7
- 0033453040
- Simple Markov-chain algorithms for generating bipartite graphs and tournaments
- Kannan, R.-Tetali, P.-Vempala, S.: Simple Markov-chain algorithms for generating bipartite graphs and tournaments, Rand. Struct. Alg. 14 (4) (1999), 293-308.
- (1999) Rand. Struct. Alg. , vol.14 , Issue.4 , pp. 293-308
- Kannan, R.¹ Tetali, P.² Vempala, S.³

9
- 84990671447
- A critical point for random graphs with a given degree sequence
- Molloy, M.-Reed, B.: A critical point for random graphs with a given degree sequence, Rand. Struct. Alg. 6 (2-3) (1995), 161-179.
- (1995) Rand. Struct. Alg. , vol.6 , Issue.2-3 , pp. 161-179
- Molloy, M.¹ Reed, B.²

10
- 84884073625
- (Princeton Studies in Complexity, Princeton UP)
- Newman, M.E.J.-Barabasi, A.L.-Watts, D.J.: The Structure and Dynamics of Networks (Princeton Studies in Complexity, Princeton UP) (2006), pp 624.
- (2006) The Structure and Dynamics of Networks , pp. 624
- Newman, M.E.J.¹ Barabasi, A.L.² Watts, D.J.³

11
- 0001203681
- Combinatorial properties of matrices of zeros and ones
- Ryser, H. J.: Combinatorial properties of matrices of zeros and ones, Canad. J. Math. 9 (1957), 371-377.
- (1957) Canad. J. Math. , vol.9 , pp. 371-377
- Ryser, H.J.¹

12
- 84971804758
- Improved bounds for mixing rates of Markov chains and multicommodity flow
- Sinclair, A.: Improved bounds for mixing rates of Markov chains and multicommodity flow, Combin. Probab. Comput. 1 (1992), 351-370.
- (1992) Combin. Probab. Comput. , vol.1 , pp. 351-370
- Sinclair, A.¹

13
- 0012626403
- Oxford University Press, New York
- Steinhaus, H.: Mathematical Snapshots, Oxford University Press, New York, 1950. pp 30.
- (1950) Mathematical Snapshots , pp. 30
- Steinhaus, H.¹

14
- 0039663042
- Generating random regular graphs
- Wormald, N.C.: Generating random regular graphs, J. Algorithms 5 (1984), 247-280.
- (1984) J. Algorithms , vol.5 , pp. 247-280
- Wormald, N.C.¹

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.