Imagen de Portada

Source-Oblivious Broadcast

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Fraigniaud, Pierre, Harutyunyan, Hovhannes A.
Formato:	Preprint
Publicado:	2025
Materias:	Data Structures and Algorithms Discrete Mathematics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

On the parameterized complexity of Broadcast Independence and Broadcast Packing
por: Dumont, Joanne, et al.
Publicado: (2026)

Sorting with constraints
por: Manas, A.
Publicado: (2025)

Extending Ghouila-Houri's Characterization of Comparability Graphs to Temporal Graphs
por: Charbit, Pierre, et al.
Publicado: (2025)

Functional design of efficient and parallelizable combinatorial generators using convolution
por: He, Xi, et al.
Publicado: (2025)

Twice-Ramanujan Sparsifiers
por: Batson, Joshua, et al.
Publicado: (2008)

Polynomial Kernels for Spanning Tree with Diversity Requirements
por: Golovach, Petr A., et al.
Publicado: (2026)

Distance Recoloring
por: Banerjee, Niranka, et al.
Publicado: (2024)

When does FTP become FPT?
por: Bentert, Matthias, et al.
Publicado: (2025)

Edge Clique Partition and Cover Beyond Independence
por: Fomin, Fedor V., et al.
Publicado: (2025)

Fault-Tolerant Matroid Bases
por: Bentert, Matthias, et al.
Publicado: (2025)

Stability in Graphs with Matroid Constraints
por: Fomin, Fedor V., et al.
Publicado: (2024)

H-Planarity and Parametric Extensions: when Modulators Act Globally
por: Fomin, Fedor V., et al.
Publicado: (2025)

Path Cover, Hamiltonicity, and Independence Number: An FPT Perspective
por: Fomin, Fedor V., et al.
Publicado: (2024)

String Matching with a Dynamic Pattern
por: Monteiro, Bruno, et al.
Publicado: (2025)

Inverse matroid optimization under subset constraints
por: Bérczi, Kristóf, et al.
Publicado: (2025)

Continuous Petri Nets for Fast Yield Computation: Polynomial-Time and MILP Approaches
por: Jordon, Addie, et al.
Publicado: (2025)

Graph Coloring Below Guarantees via Co-Triangle Packing
por: Akmal, Shyan, et al.
Publicado: (2025)

An Approximation Algorithm for Monotone Submodular Cost Allocation
por: Mizutani, Ryuhei
Publicado: (2025)

Greedy Algorithms for Shortcut Sets and Hopsets
por: Bals, Ben, et al.
Publicado: (2025)

Approximating Submodular Matroid-Constrained Partitioning
por: Bérczi, Kristóf, et al.
Publicado: (2025)

Space-Efficient Hierholzer: Eulerian Cycles in $\mathrm{O}(m)$ Time and $\mathrm{O}(n)$ Space
por: Alaoui, Ziad Ismaili, et al.
Publicado: (2025)

A Simple and Fast $(3+\varepsilon)$-approximation for Constrained Correlation Clustering
por: Veldt, Nate
Publicado: (2025)

(Approximate) Matrix Multiplication via Convolutions
por: Uffenheimer, Yahel, et al.
Publicado: (2025)

UAIC_Twin_Width: An Exact yet Efficient Twin-Width Algorithm
por: Arhire, Andrei, et al.
Publicado: (2025)

Polynomial-time algorithms for PATH COVER and PATH PARTITION on trees and graphs of bounded treewidth
por: Foucaud, Florent, et al.
Publicado: (2025)

Circle graphs can be recognized in linear time
por: Paul, Christophe, et al.
Publicado: (2025)

A Parameterized Perspective on Uniquely Restricted Matchings
por: Chaudhary, Juhi, et al.
Publicado: (2025)

Parameterized Complexity of s-Club Cluster Edge Deletion: When Is the Diameter Bound Necessary?
por: Gaikwad, Ajinkya
Publicado: (2025)

Testing Quasiperiodicity
por: Awofeso, Christine, et al.
Publicado: (2025)

Unsplittable Cost Flows from Unweighted Error-Bounded Variants
por: Swamy, Chaitanya, et al.
Publicado: (2025)

An Exact Solver for Submodular Knapsack Problems
por: Münch, Sabine, et al.
Publicado: (2025)

Beware of the Classical Benchmark Instances for the Traveling Salesman Problem with Time Windows
por: Soulignac, Francisco J.
Publicado: (2025)

Fast approximation algorithms for the 1-median problem on real-world large graphs
por: Ueta, Keisuke, et al.
Publicado: (2025)

(Almost-)Optimal FPT Algorithm and Kernel for $T$-Cycle on Planar Graphs
por: Gahlawat, Harmender, et al.
Publicado: (2025)

Path Contraction Faster than $2^n$
por: Agrawal, Akanksha, et al.
Publicado: (2025)

Treewidth Parameterized by Feedback Vertex Number
por: Molter, Hendrik, et al.
Publicado: (2025)

Nyldon Factorization of Thue-Morse Words and Fibonacci Words
por: Kishi, Kaisei, et al.
Publicado: (2025)

Generating pivot Gray codes for spanning trees of complete graphs in constant amortized time
por: Liu, Bowie, et al.
Publicado: (2025)

Sequential testing problem: A follow-up review
por: Ünlüyurt, Tonguç
Publicado: (2025)

Depth-13 Sorting Networks for 28 Channels
por: Wang, Chengu
Publicado: (2025)