Cargando…
Efficiently sampling the realizations of bounded, irregular degree sequences of bipartite and directed graphs
Since 1997 a considerable effort has been spent on the study of the swap (switch) Markov chains on graphic degree sequences. All of these results assume some kind of regularity in the corresponding degree sequences. Recently, Greenhill and Sfragara published a breakthrough paper about irregular norm...
Autores principales: | Erdős, Péter L., Mezei, Tamás Róbert, Miklós, István, Soltész, Dániel |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Public Library of Science
2018
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6089458/ https://www.ncbi.nlm.nih.gov/pubmed/30102714 http://dx.doi.org/10.1371/journal.pone.0201995 |
Ejemplares similares
-
Lower Bounds on the Number of Realizations of Rigid Graphs
por: Grasegger, Georg, et al.
Publicado: (2018) -
On the Treewidths of Graphs of Bounded Degree
por: Song, Yinglei, et al.
Publicado: (2015) -
Approximate Counting of Graphical Realizations
por: Erdős, Péter L., et al.
Publicado: (2015) -
A Generalized Information-Theoretic Approach for Bounding the Number of Independent Sets in Bipartite Graphs
por: Sason, Igal
Publicado: (2021) -
On the least signless Laplacian eigenvalue of a non-bipartite connected graph with fixed maximum degree
por: Guo, Shu-Guang, et al.
Publicado: (2017)