:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Author:	Aghanya, Nnamdi Daniel
Format:	Preprint
Published:	2025
Subjects:	Social and Information Networks 05C82, 05C20, 05C22, 68Q25, 93A14 F.2.2; G.2.2; C.2.4
Online Access:	https://arxiv.org/abs/2509.19630
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Heaven & Hell II: Scale Laws and Robustness in One-Step Heaven-Hell Consensus
by: Aghanya, Nnamdi Daniel, et al.
Published: (2025)

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

Mathematical Foundations for Peer-to-Peer Lattice Computation
by: Gorinevski, Danil
Published: (2026)

ARRIVAL: Recursive Framework & $\ell_1$-Contraction
by: Haslebacher, Sebastian
Published: (2025)

Exploration of $k$-edge-deficient temporal graphs in linear time
by: Lahtin, Ivan, et al.
Published: (2026)

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

How quickly can you pack short paths? Engineering a search-tree algorithm for disjoint s-t paths of bounded length
by: Huber, Michael Kiran
Published: (2024)

DAG Scheduling in the BSP Model
by: Papp, Pál András, et al.
Published: (2023)

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

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

Cluster Before You Hallucinate: Approximating Node-Capacitated Network Design and Energy Efficient Routing
by: Krishnaswamy, Ravishankar, et al.
Published: (2014)

A New Temporal Interpretation of Cluster Editing
by: Bocci, Cristiano, et al.
Published: (2022)

A Constant-factor Approximation for Weighted Bond Cover
by: Kim, Eun Jung, et al.
Published: (2021)

On (In)approximability of MaxMin Independent Set Reconfiguration
by: Hoang, Hung P., et al.
Published: (2026)

A new density limit for unanimity in majority dynamics on random graphs
by: Kim, Jeong Han, et al.
Published: (2025)

Graph polynomials: some questions on the edge
by: Farr, Graham, et al.
Published: (2024)

On the MST-ratio: Theoretical Bounds and Complexity of Finding the Maximum
by: Ameli, Afrouz Jabal, et al.
Published: (2024)

Model-Checking for First-Order Logic with Disjoint Paths Predicates in Proper Minor-Closed Graph Classes
by: Golovach, Petr A., et al.
Published: (2022)

Traffic-Oblivious Multi-Commodity Flow Network Design
by: Chimani, Markus, et al.
Published: (2025)

DCOR: Anomaly Detection in Attributed Networks via Dual Contrastive Learning Reconstruction
by: Rafieizadeh, Hossein, et al.
Published: (2024)

Fully Dynamic Breadth First Search and Spanning Trees in Directed Graphs
by: Morse, Gregory, et al.
Published: (2026)

Model Checking for Low Monodimensionality Fragments of CMSO on Topological-Minor-Free Graph Classes
by: Sau, Ignasi, et al.
Published: (2026)

Theta-Relations Among Degree-Based Tree Indices
by: Abdullah, Duaa, et al.
Published: (2026)

Computing shortest closed curves on non-orientable surfaces
by: Bulavka, Denys, et al.
Published: (2024)

Introducing COGENT3: An AI Architecture for Emergent Cognition
by: Salazar, Eduardo
Published: (2025)

Edgewise Envelopes Between Balanced Forman and Ollivier-Ricci Curvature
by: Micaletto, Giorgio, et al.
Published: (2026)

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

The price of homogeneity is polynomial
by: Gorsky, Maximilian, et al.
Published: (2026)

Dynamic programming on bipartite tree decompositions
by: Jaffke, Lars, et al.
Published: (2023)

Graph modification of bounded size to minor-closed classes as fast as vertex deletion
by: Morelle, Laure, et al.
Published: (2025)

Separating Matchings in Cubic Graphs
by: Gutiérrez, Juan, et al.
Published: (2026)

On treewidth and maximum cliques
by: Chudnovsky, Maria, et al.
Published: (2024)

Counting Kernels in Directed Graphs with Arbitrary Orientations
by: Jartoux, Bruno
Published: (2022)

Excluding a Ladder as an Induced Minor in Graphs Without Induced Stars
by: Choi, Mujin, et al.
Published: (2025)

Temporalizing digraphs via linear-size balanced bi-trees
by: Bessy, Stéphane, et al.
Published: (2023)

Minor Embedding in Broken Chimera and Pegasus Graphs is NP-complete
by: Lobe, Elisabeth, et al.
Published: (2021)

Graphs whose vertices of degree at least 2 lie in a triangle
by: Forte, Vinicius L. do, et al.
Published: (2022)

The frequency $K_i$s for symmetrical traveling salesman problem
by: Wang, Yong
Published: (2025)

Bounds of Trees with Degree Sequence-Based Topological Indices on Specialized Graph Classes
by: Hamoud, Jasem, et al.
Published: (2025)

Extremal Degree Irregularity Bounds for Albertson and Sigma Indices in Trees and Bipartite Graphs
by: Hamoud, Jasem, et al.
Published: (2025)