Imagen de Portada

Balancing the Spread of Two Opinions in Sparse Social Networks

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Knop, Dušan, Schierreich, Šimon, Suchý, Ondřej
Formato:	Preprint
Publicado:	2021
Materias:	Data Structures and Algorithms
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Host Community Respecting Refugee Housing
por: Knop, Dušan, et al.
Publicado: (2023)

Equitable Connected Partition and Structural Parameters Revisited: N-fold Beats Lenstra
por: Blažej, Václav, et al.
Publicado: (2024)

Pathfinding in Self-Deleting Graphs
por: Dvořák, Michal, et al.
Publicado: (2025)

Individual Rationality in Topological Distance Games is Surprisingly Hard
por: Deligkas, Argyrios, et al.
Publicado: (2024)

Parameterized Critical Node Cut Revisited
por: Knop, Dušan, et al.
Publicado: (2025)

Approximation Algorithms for Steiner Tree Based on Star Contractions: A Unified View
por: Hušek, Radek, et al.
Publicado: (2020)

Parameterized Complexity of Scheduling Problems in Robotic Process Automation
por: Dvořák, Michal, et al.
Publicado: (2026)

Exact Algorithms for Distance to Unique Vertex Cover
por: Fioravantes, Foivos, et al.
Publicado: (2025)

Parameterized Complexity of Directed Traveling Salesman Problem
por: Blažej, Václav, et al.
Publicado: (2025)

Opinion Maximization in Social Networks by Modifying Internal Opinions
por: Wang, Gengyu, et al.
Publicado: (2025)

Balancing Two-Dimensional Straight-Line Programs
por: Boneh, Itai, et al.
Publicado: (2025)

Improved Online Load Balancing in the Two-Norm
por: Borst, Sander, et al.
Publicado: (2025)

High-Multiplicity Fair Allocation Using Parametric Integer Linear Programming
por: Bredereck, Robert, et al.
Publicado: (2020)

Towards Constant Time Multi-Call Rumor Spreading on Small-Set Expanders
por: Cruciani, Emilio, et al.
Publicado: (2025)

Online Graph Balancing and the Power of Two Choices
por: Bansal, Nikhil, et al.
Publicado: (2026)

Load Balancing with Duration Predictions
por: Azar, Yossi, et al.
Publicado: (2025)

History-Independent Load Balancing
por: Bender, Michael A., et al.
Publicado: (2026)

Concurrent Balanced Augmented Trees
por: Wrench, Evan, et al.
Publicado: (2026)

Approximating Small Sparse Cuts
por: Anand, Aditya, et al.
Publicado: (2024)

Counting Balanced Triangles on Social Networks With Uncertain Edge Signs
por: Zhou, Alexander, et al.
Publicado: (2026)

Listing 6-Cycles in Sparse Graphs
por: Williams, Virginia Vassilevska, et al.
Publicado: (2024)

Local Max-Cut on Sparse Graphs
por: Schwartzman, Gregory
Publicado: (2023)

Sparse Random Matrices for Dimensionality Reduction
por: Mackenzie, Pierre
Publicado: (2025)

Revisiting the Sparse Matrix Compression Problem
por: Jugé, Vincent, et al.
Publicado: (2026)

Testing Sparse Functions over the Reals
por: Arora, Vipul, et al.
Publicado: (2026)

An Improved Algorithm for Sparse Instances of SAT
por: Jain, Sanjay, et al.
Publicado: (2024)

Approximation Algorithms for Scheduling Crowdsourcing Tasks in Mobile Social Networks
por: Chen, Chi-Yeh
Publicado: (2025)

Hardness and Approximation Algorithms for Balanced Districting Problems
por: Dharangutte, Prathamesh, et al.
Publicado: (2025)

Finding the Balance Rate of Uncertain Signed Graphs
por: Wang, Zeyu, et al.
Publicado: (2026)

Improved Approximation Algorithm for Maximum Balanced Biclique
por: Manurangsi, Pasin
Publicado: (2026)

Balancing Weights, Directed Sparsification, and Augmenting Paths
por: Li, Jason
Publicado: (2026)

Dominating Set with Quotas: Balancing Coverage and Constraints
por: Chatterjee, Sobyasachi, et al.
Publicado: (2026)

Improved Sparse Recovery for Approximate Matrix Multiplication
por: Uffenheimer, Yahel, et al.
Publicado: (2026)

Efficient Trace Frequency Queries in Sparse Graphs
por: Awofeso, Christine, et al.
Publicado: (2025)

Fully Dynamic Shortest Paths in Sparse Digraphs
por: Karczmarz, Adam, et al.
Publicado: (2024)

Improved Algorithms for Unrelated Crowd Worker Scheduling in Mobile Social Networks
por: Chen, Chi-Yeh
Publicado: (2026)

Output-Sparse Matrix Multiplication Using Compressed Sensing
por: Bennett, Huck, et al.
Publicado: (2025)

Probabilistic AVL Trees (p-AVL): Relaxing Deterministic Balancing
por: Desikan, Hayagriv
Publicado: (2026)

Streaming and Communication Complexity of Load-Balancing via Matching Contractors
por: Assadi, Sepehr, et al.
Publicado: (2024)

Tight Bounds for Online Balanced Partitioning in the Generalized Learning Model
por: Räcke, Harald, et al.
Publicado: (2024)