Imagen de Portada

Degree-preserving graph dynamics -- a versatile process to construct random networks

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Erdős, Péter L., Kharel, Shubha R., Mezei, Tamás R., Toroczkai, Zoltán
Formato:	Preprint
Publicado:	2021
Materias:	Combinatorics Discrete Mathematics Physics and Society 05C07, 05C80, 05C82, 91D30, 68R10, 68W40, 68Q15, 03D15 G.2.2; G.2.3; F.1.3
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

New results on graph matching from degree preserving growth
por: Erdős, Péter L., et al.
Publicado: (2022)

The Gallai Vertex Problem is $Θ_2^p$-Complete
por: Nikabadi, Amir, et al.
Publicado: (2026)

Packing, Hitting, and Colouring Squares
por: Caoduro, Marco, et al.
Publicado: (2022)

Enumeration Kernels of Polynomial Size for Cuts of Bounded Degree
por: Komusiewicz, Christian, et al.
Publicado: (2023)

An Improved Drift Theorem for Balanced Allocations
por: Los, Dimitrios, et al.
Publicado: (2023)

Dirac's theorem and the switch geometry of perfect matchings
por: Kang, Ross J., et al.
Publicado: (2026)

Local iterative algorithms for approximate symmetry guided by network centralities
por: Hartman, David, et al.
Publicado: (2025)

Dynamic Traffic Assignment for Public Transport with Vehicle Capacities
por: Patzner, Julian, et al.
Publicado: (2024)

Backbone coloring for graphs with degree 4
por: Michalik, Krzysztof, et al.
Publicado: (2024)

Online coloring of short interval graphs and two-count interval graphs
por: Curbelo, Israel R.
Publicado: (2024)

On the Average-Case Performance of Greedy for Maximum Coverage
por: Balkanski, Eric, et al.
Publicado: (2026)

Dual-Channel Feature Fusion for Joint Prediction in Dynamic Signed Weighted Networks
por: Zhang, Gaoxin, et al.
Publicado: (2026)

Adjacent vertex distinguishing total coloring of 3-degenerate graphs
por: Behera, Diptimaya, et al.
Publicado: (2025)

The Power of Filling in Balanced Allocations
por: Los, Dimitrios, et al.
Publicado: (2022)

Mean-Biased Processes for Balanced Allocations
por: Los, Dimitrios, et al.
Publicado: (2023)

Bell Numbers and Stirling Numbers of the Mycielskian of Trees
por: Allagan, J., et al.
Publicado: (2025)

Design, Configuration, Implementation, and Performance of a Simple 32 Core Raspberry Pi Cluster
por: Cicirello, Vincent A.
Publicado: (2017)

#P is Sandwiched by One and Two #2DNF Calls: Is Subtraction Stronger Than We Thought?
por: Bannach, Max, et al.
Publicado: (2025)

Scalable Domain-decomposed Monte Carlo Neutral Transport for Nuclear Fusion
por: Lappi, Oskar, et al.
Publicado: (2025)

Amnesiac Flooding: Easy to break, hard to escape
por: Austin, Henry, et al.
Publicado: (2025)

Metric Dimension and Resolvability of Jaccard Spaces
por: Lladser, Manuel E., et al.
Publicado: (2024)

Boltzmann sampling and optimal exact-size sampling for directed acyclic graphs
por: Gabryelski, Wojciech, et al.
Publicado: (2026)

Formal Probabilistic Methods for Combinatorial Structures using the Lovász Local Lemma
por: Edmonds, Chelsea, et al.
Publicado: (2023)

Optimal Graph Stretching for Distributed Averaging
por: Dekker, Florine W., et al.
Publicado: (2025)

An asymptotically optimal algorithm for generating bin cardinalities
por: Devroye, Luc, et al.
Publicado: (2024)

A Mathematical Theory of Discursive Networks
por: Gutiérrez, Juan B.
Publicado: (2025)

Quickly excluding an annotated planar graph
por: Gorsky, Maximilian, et al.
Publicado: (2026)

Towards a conjecture on long induced rainbow paths in triangle-free graphs
por: Aravind, N. R., et al.
Publicado: (2026)

The Parity-Constrained Four-Peg Tower of Hanoi Problem and Its Associated Graph
por: Mehiri, El-Mehdi
Publicado: (2025)

W-state graphs: Structure and Algorithms
por: Gajjala, Rishikesh, et al.
Publicado: (2026)

Spectrum Estimation through Kirchhoff Random Forests
por: Barthelmé, Simon, et al.
Publicado: (2025)

Minimal obstructions to $C_5$-coloring in hereditary graph classes
por: Goedgebeur, Jan, et al.
Publicado: (2024)

Catching Rats in $H$-minor-free Graphs
por: Gorsky, Maximilian, et al.
Publicado: (2025)

The weighted Tower of Hanoi
por: Mehiri, El-Mehdi, et al.
Publicado: (2022)

Tangled Paths: A Random Graph Model from Mallows Permutations
por: Enright, Jessica, et al.
Publicado: (2021)

A framework for distributed discrete evacuation strategies
por: Borowiecki, Piotr, et al.
Publicado: (2025)

Polynomial Bounds for the Graph Minor Structure Theorem
por: Gorsky, Maximilian, et al.
Publicado: (2025)

A Fast 3-Approximation for the Capacitated Tree Cover Problem with Edge Loads
por: Rockel-Wolff, Benjamin
Publicado: (2024)

On the Complexity of Minimum Riesz s-Energy Subset Selection in Euclidean and Ultrametric Spaces
por: Emmerich, Michael T. M., et al.
Publicado: (2026)

Irregularity and Topological Indices in Fibonacci Word Trees and Modified Fibonacci Word Index
por: Hamoud, Jasem, et al.
Publicado: (2025)