Image de couverture de livre

Determining distances and consensus between mutation trees

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Cunha, Luís, Kuipers, Jack, Lopes, Thiago
Format:	Preprint
Publié:	2025
Sujets:	Computational Complexity Discrete Mathematics 05C05, 05C85
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Token Jumping in Planar Graphs has Linear Sized Kernels
par: Cranston, Daniel W.
Publié: (2024)

Constricting the Computational Complexity Gap of the $4$-Coloring Problem in $(P_t,C_3)$-free Graphs
par: Jaworska, Justyna, et autres
Publié: (2025)

Corrigendum to "On the monophonic rank of a graph" [Discrete Math. Theor. Comput. Sci. 24:2 (2022) #3]
par: Dourado, Mitre C., et autres
Publié: (2023)

The strong vertex span of trees
par: Grašič, Mateja, et autres
Publié: (2024)

Layered tree-independence number and clique-based separators
par: Dallard, Clément, et autres
Publié: (2025)

Graph Burning: Bounds and Hardness
par: Antony, Dhanyamol, et autres
Publié: (2024)

Exploring subgraph complementation to bounded degree graphs
par: Koch, Ivo, et autres
Publié: (2025)

Finding happiness by evolutionary algorithms
par: Shekarriz, Mohammad Hadi, et autres
Publié: (2025)

Removing bottlenecks in the recognition of small $(k,\ell)$-graph classes
par: Bonomo-Braberman, Flavia, et autres
Publié: (2025)

Token sliding independent set reconfiguration on block graphs
par: Francis, Mathew C., et autres
Publié: (2024)

Vertex evaluation of multiplex graphs using Forman Curvature
par: Yamada, Taiki
Publié: (2025)

On the structure of (dart, odd hole)-free graphs
par: Hoàng, Chính T.
Publié: (2025)

$\mathcal{O}(VE)$ time algorithms for the Grundy (First-Fit) chromatic number of block graphs and graphs with sufficiently large girth
par: Zaker, Manouchehr
Publié: (2024)

Recognition of chordal graphs and cographs which are Cover-Incomparability graphs
par: Anil, Arun, et autres
Publié: (2023)

On z-coloring and ${\rm b}^{\ast}$-coloring of graphs as improved variants of the b-coloring
par: Zaker, Manouchehr
Publié: (2024)

Deduction, Constrained Zero Forcing, and Constrained Searching
par: Burgess, Andrea, et autres
Publié: (2024)

More relations between $λ$-labeling and Hamiltonian paths with emphasis on line graph of bipartite multigraphs
par: Zaker, Manouchehr
Publié: (2021)

Minimal $L^p$-congestion spanning trees on weighted graphs
par: Lafuente, Alberto Castejón, et autres
Publié: (2025)

Local Search Improvements for Soft Happy Colouring
par: Shekarriz, Mohammad Hadi, et autres
Publié: (2025)

Computing the permanental polynomial of $4k$-intercyclic bipartite graphs
par: Bapat, Ravindra B., et autres
Publié: (2024)

Finding hypergraph immersion is fixed-parameter tractable
par: Meng, Xiangyi, et autres
Publié: (2024)

Four Dominion Growth Regimes in Trees: Forcing, Fibonacci Enumeration, Periodicity, and Stability
par: Allagan, Julian, et autres
Publié: (2026)

Hamilton decompositions of the directed 7-torus at odd modulus via root-flat certificates and a prefix-count construction
par: Park, SangHyun
Publié: (2026)

On Intersection Graphs of Graphs and Hypergraphs: A Survey
par: Naik, Ranjan N.
Publié: (2018)

Graphs whose Eulerian trails have unique labels
par: Kim, Donggyu, et autres
Publié: (2026)

$K_2$-Hamiltonian Graphs: II
par: Goedgebeur, Jan, et autres
Publié: (2023)

Combinatorial properties of continuous graphs: A survey of challenges, solutions and open problems
par: Grigoriev, Alexander, et autres
Publié: (2025)

A simple quadratic kernel for Token Jumping on surfaces
par: Cranston, Daniel W., et autres
Publié: (2024)

Conformal Hypergraphs: Duality and Implications for the Upper Clique Transversal Problem
par: Boros, Endre, et autres
Publié: (2023)

Generation and New Infinite Families of $K_2$-hypohamiltonian Graphs
par: Goedgebeur, Jan, et autres
Publié: (2023)

Optimal List Recoloring of Subcubic Graphs and Complete Multipartite Graphs
par: De Meyer, Lucas
Publié: (2025)

On the Boxicity of Line Graphs and of Their Complements
par: Caoduro, Marco, et autres
Publié: (2025)

An Overview of Universal Obstructions for Graph Parameters
par: Paul, Christophe, et autres
Publié: (2023)

An NP-hardness result for the colored constrained maximum 2-edge-colorable subgraph problem in bipartite graphs
par: Mkrtchyan, Vahan
Publié: (2024)

On the Complexity of Distance-$d$ Independent Set Reconfiguration
par: Hoang, Duc A.
Publié: (2022)

Characterizations of undirected 2-quasi best match graphs
par: Korchmaros, Annachiara, et autres
Publié: (2025)

Graph theoretic and algorithmic aspect of the equitable coloring problem in block graphs
par: Furmańczyk, Hanna, et autres
Publié: (2020)

The 2-domination number of cylindrical graphs
par: Martínez, José Antonio, et autres
Publié: (2024)

On 3-Coloring of $(2P_4,C_5)$-Free Graphs
par: Jelínek, Vít, et autres
Publié: (2020)

Edge open packing: complexity, algorithmic aspects, and bounds
par: Brešar, Boštjan, et autres
Publié: (2024)