Uniform Sampling of Digraphs with a Fixed Degree Sequence (Q3057627): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q820153
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Matthias Müller-Hannemann / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-642-16926-7_21 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1541582128 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3135094 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4878667 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Properties of Matrices of Zeros and Ones / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the realization of a (p,s)-digraph with prescribed degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Factors of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for constructing graphs and digraphs with given valences and factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3230887 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the degrees of the vertices of a directed graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple Havel-Hakimi type algorithm to realize graphical degree sequences of directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4262220 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sampling Regular Graphs and a Peer-to-Peer Network / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sampling binary contingency tables with a greedy start / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniform generation of random regular graphs of moderate degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic enumeration by degree sequence of graphs with degrees \(o(n^{1/2})\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating Random Regular Graphs Quickly / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating random regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sequential algorithm for generating random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4365843 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank
 
Normal rank

Latest revision as of 12:07, 3 July 2024

scientific article
Language Label Description Also known as
English
Uniform Sampling of Digraphs with a Fixed Degree Sequence
scientific article

    Statements

    Uniform Sampling of Digraphs with a Fixed Degree Sequence (English)
    0 references
    16 November 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references