Imagen de Portada

Complexity and algorithms for Swap median and relation to other consensus problems

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Cunha, Luís, Lopes, Thiago, Mary, Arnaud
Formato:	Preprint
Publicado:	2024
Materias:	Computational Complexity 68R05 G.2.0
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

On the restricted Hanoi Graphs
por: Mehiri, El-Mehdi
Publicado: (2023)

De Bruijn Sequences with Minimum Discrepancy
por: Álvarez, Nicolás, et al.
Publicado: (2024)

Noisy decoding by shallow circuits with parities: classical and quantum
por: Briët, Jop, et al.
Publicado: (2023)

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

Deciding One to One property of Boolean maps: Condition and algorithm in terms of implicants
por: Sule, Virendra
Publicado: (2023)

Complexity of Sequence-to-Graph Alignment with Co-Linear Chaining
por: Li, Xingfu
Publicado: (2026)

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

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

Faster parameterized algorithms for modification problems to minor-closed classes
por: Morelle, Laure, et al.
Publicado: (2022)

Folding One Polyhedral Metric Graph into Another
por: Chung, Lily, et al.
Publicado: (2024)

Descriptive complexity for neural networks via Boolean networks
por: Ahvonen, Veeti, et al.
Publicado: (2023)

On the Asymptotic Palindrome Density of Fibonacci Infinite Words
por: Abdullah, Duaa, et al.
Publicado: (2025)

Dynamic and Programmatic Analysis of Fibonacci Word Density
por: Abdullah, Duaa, et al.
Publicado: (2025)

Generalized Natural Density $\DF(\mathfrak{F}_n)$ of Fibonacci Word
por: Hamoud, Jasem, et al.
Publicado: (2025)

Improvement Ergodic Theory For The Infinite Word $\mathfrak{F}=\mathfrak{F}_{b}:=\left({ }_{b} f_{n}\right)_{n \geqslant 0}$ on Fibonacci Density
por: Hamoud, Jasem, et al.
Publicado: (2025)

Slice rank and partition rank of the determinant
por: Lampert, Amichai, et al.
Publicado: (2025)

Complexity of chess domination problems
por: Langlois-Rémillard, Alexis, et al.
Publicado: (2022)

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

The central tree property and algorithmic problems on subgroups of free groups
por: Roy, Mallika, et al.
Publicado: (2023)

m-Eternal Domination and Variants on Some Classes of Finite and Infinite Graphs
por: Calamoneri, Tiziana, et al.
Publicado: (2025)

The Minimum Eternal Vertex Cover Problem on a Subclass of Series-Parallel Graphs
por: Calamoneri, Tiziana, et al.
Publicado: (2025)

Transient anisotropic kernel for probabilistic learning on manifolds
por: Soize, Christian, et al.
Publicado: (2024)

Topological Indices With Degree Sequence $\mathscr{D}$ of Tree
por: Hamoud, Jasem, et al.
Publicado: (2025)

Identification to Subclasses of Chordal Graphs
por: Golovach, Petr A., et al.
Publicado: (2026)

Determining distances and consensus between mutation trees
por: Cunha, Luís, et al.
Publicado: (2025)

The Directed Disjoint Paths Problem with Congestion
por: Bentert, Matthias, et al.
Publicado: (2025)

An efficient algorithm for identifying rainbow ortho-convex 4-sets in k-colored point sets
por: Flores-Peñaloza, David, et al.
Publicado: (2024)

Polynomial Complexity of Inversion of sequences and Local Inversion of Maps
por: Sule, Virendra
Publicado: (2024)

A Pressure-Based Diffusion Model for Influence Maximization on Social Networks
por: Stutsman, Curt, et al.
Publicado: (2025)

XALP-completeness of Parameterized Problems on Planar Graphs
por: Bodlaender, Hans L., et al.
Publicado: (2024)

Continuous Flattening and Reversing of Convex Polyhedral Linkages
por: Demaine, Erik D., et al.
Publicado: (2024)

Logarithmic Weisfeiler--Leman and Treewidth
por: Levet, Michael, et al.
Publicado: (2023)

Canonizing Graphs of Bounded Rank-Width in Parallel via Weisfeiler--Leman
por: Levet, Michael, et al.
Publicado: (2023)

On The Optimal General Solution To The Multi-Peg Tower of Hanoi
por: Menon, Abhiram
Publicado: (2025)

Smaller Depth-2 Linear Circuits for Disjointness Matrices
por: Ye, Lixi
Publicado: (2026)

Edge-coloring problems with forbidden patterns and planted colors
por: Barsukov, Alexey, et al.
Publicado: (2025)

Large cliques and large independent sets: can they coexist?
por: Feige, Uriel, et al.
Publicado: (2025)

Which graph motif parameters count?
por: Bläser, Markus, et al.
Publicado: (2025)

A Study of NP-Completeness and Undecidable Word Problems in Semigroups
por: Abdullah, Duaa, et al.
Publicado: (2025)

On the Complexity of the Minimum-($k,ρ$)-Shortcut Problem
por: Avila, Tatiana Rocha, et al.
Publicado: (2026)