Imagen de Portada

Extending Robinson Spaces: Complexity and Algorithmic Solutions for Non-Symmetric Dissimilarity Spaces

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Brucker, Francois, Préa, Pascal, Caro, Christopher Thraves
Formato:	Preprint
Publicado:	2024
Materias:	Discrete Mathematics Combinatorics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Exploring Algorithmic Solutions for the Independent Roman Domination Problem in Graphs
por: Paul, Kaustav, et al.
Publicado: (2024)

Acyclic, Star and Injective Colouring: A Complexity Picture for H-Free Graphs
por: Bok, Jan, et al.
Publicado: (2020)

Complexity and algorithms for Arc-Kayles and Non-Disconnecting Arc-Kayles
por: Burke, Kyle, et al.
Publicado: (2024)

Bounds on Functionality and Symmetric Difference -- Two Intriguing Graph Parameters
por: Dvořák, Pavel, et al.
Publicado: (2023)

4-tangrams are 4-avoidable
por: Ochem, Pascal, et al.
Publicado: (2025)

Contact graphs of boxes with unidirectional contacts
por: Gonçalves, Daniel, et al.
Publicado: (2023)

On graphs with a simple structure of maximal cliques
por: Gollin, J. Pascal, et al.
Publicado: (2025)

Critical exponent of binary words with few distinct palindromes
por: Dvořáková, L'ubomíra, et al.
Publicado: (2023)

Optimizing alphabet reduction pairs of arrays
por: Culus, Jean-François, et al.
Publicado: (2024)

A Necessary Condition for Connectedness of Solutions to Integer Linear Systems
por: Shigenobu, Takasugu, et al.
Publicado: (2025)

Acyclic colourings of graphs with obstructions
por: Chuet, Quentin, et al.
Publicado: (2022)

Algorithms and hardness for Metric Dimension on digraphs
por: Dailly, Antoine, et al.
Publicado: (2023)

HBS Tilings Extended: State of the Art and Novel Observations
por: Porrier, Carole
Publicado: (2023)

A Note on the Complexity of Graph Recoloring
por: Bousquet, Nicolas
Publicado: (2024)

Line Graphs of Non-Word-Representable Graphs are Not Always Non-Word-Representable
por: Mozhui, Khyodeno, et al.
Publicado: (2025)

An Efficient Genus Algorithm Based on Graph Rotations
por: Metzger, Alexander, et al.
Publicado: (2024)

Space Efficient Algorithms for Parameterised Problems
por: Akhtar, Sheikh Shakil, et al.
Publicado: (2025)

On the Identity and Group Problems for Complex Heisenberg Matrices
por: Bell, Paul C., et al.
Publicado: (2023)

The Non-Cancelling Intersections Conjecture
por: Amarilli, Antoine, et al.
Publicado: (2024)

Non-dissective coverings by planks
por: Kupavskii, Andrey, et al.
Publicado: (2025)

The Complexity of Color-constrained Paths in Semicomplete Multipartite Digraphs
por: Brinkmann, Julian
Publicado: (2025)

Hypergraphs with Polynomial Representation: Introducing $r$-splits
por: Pitois, François, et al.
Publicado: (2022)

New bounds for proper $h$-conflict-free colourings
por: Chuet, Quentin, et al.
Publicado: (2025)

Fractional domatic number and minimum degree
por: Chuet, Quentin, et al.
Publicado: (2025)

Algorithmic methods of finite discrete structures. Isomorphism of Nonseparable Graphs
por: Kurapov, Sergey, et al.
Publicado: (2024)

Recognition Complexity of Subgraphs of k-Connected Planar Cubic Graphs
por: Goetze, Miriam, et al.
Publicado: (2024)

Complexity Issues Concerning the Quadruple Roman Domination Problem in Graphs
por: Palagiri, V. S. R., et al.
Publicado: (2024)

On the Complexity of Hop Domination and 2-Step Domination in Graph Classes
por: Das, Sandip, et al.
Publicado: (2026)

Complexity of the Feedback Vertex Set Problem in Tournaments with Forbidden Subtournaments
por: Spirkl, Sophie, et al.
Publicado: (2026)

$χ$-Boundedness and Neighbourhood Complexity of Bounded Merge-Width Graphs
por: Bonamy, Marthe, et al.
Publicado: (2025)

An Algorithmic Upper Bound for Permanents via a Permanental Schur Inequality
por: Laddha, Aditi, et al.
Publicado: (2025)

Non-Promise Version of Unique Sink Orientations
por: Marques, Tiago Oliveira
Publicado: (2024)

Complexity Framework for Forbidden Subgraphs II: Edge Subdivision and the "H"-graphs
por: Lozin, Vadim, et al.
Publicado: (2022)

Computational Complexity of Covering Colored Mixed Multigraphs with Simple Degree Partitions
por: Bok, Jan, et al.
Publicado: (2025)

Algorithmic methods of finite discrete structures. Topological graph drawing (part I)
por: Kurapov, Sergey, et al.
Publicado: (2024)

Algorithmic methods of finite discrete structures. Topological graph drawing (part II)
por: Kurapov, Sergey, et al.
Publicado: (2024)

Computation of Graph Polynomials via Tree Decomposition: Theory, Algorithms, and Python Implementation
por: Bafna, Mehul, et al.
Publicado: (2025)

Algorithmic methods of finite discrete structures. Topological graph drawing (part IV)
por: Kurapov, Sergey, et al.
Publicado: (2025)

Non-detectable patterns hidden within sequences of bits
por: Allen, David, et al.
Publicado: (2024)

Complexity results on the decomposition of a digraph into directed linear forests and out-stars
por: Hörsch, Florian, et al.
Publicado: (2024)