Imagen de Portada

Exponential Steepest Ascent from Valued Constraint Graphs of Pathwidth Four

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Kaznatcheev, Artem, van Marle, Melle
Formato:	Preprint
Publicado:	2024
Materias:	Discrete Mathematics Data Structures and Algorithms Populations and Evolution
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

When is local search both effective and efficient?
por: Kaznatcheev, Artem, et al.
Publicado: (2024)

Local search for valued constraint satisfaction parameterized by treedepth
por: Kaznatcheev, Artem
Publicado: (2024)

Galled Perfect Transfer Networks
por: Sánchez, Alitzel López, et al.
Publicado: (2024)

All ascents exponential from valued constraint graphs of pathwidth three
por: Kaznatcheev, Artem, et al.
Publicado: (2026)

Graph-based method for constructing consensus trees
por: Torquet, Elio, et al.
Publicado: (2025)

Exponential Time Approximation for Coloring 3-Colorable Graphs
por: Guruswami, Venkatesan, et al.
Publicado: (2024)

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

A Graph Width Perspective on Partially Ordered Hamiltonian Paths and Cycles I: Treewidth, Pathwidth, and Grid Graphs
por: Beisegel, Jesse, et al.
Publicado: (2025)

Inferring Phylogenetic Networks from Required and Forbidden LCA-Constraints
por: Ebert, Patricia A., et al.
Publicado: (2026)

Analysis of Phylogeny Tracking Algorithms for Serial and Multiprocess Applications
por: Moreno, Matthew Andres, et al.
Publicado: (2024)

Split-or-decompose: Improved FPT branching algorithms for maximum agreement forests
por: Mestel, David, et al.
Publicado: (2024)

phylo2vec: a library for vector-based phylogenetic tree manipulation
por: Scheidwasser, Neil, et al.
Publicado: (2025)

Meeting times on graphs in near-cubic time
por: McAvoy, Alex
Publicado: (2026)

LvD: A New Algorithm for Computing the Likelihood of a Phylogeny
por: Bryant, David, et al.
Publicado: (2026)

Bayesian Credible Sets for Phylogenetic Tree Topologies with Applications to Coverage Analysis and Cross-Model Comparison
por: Klawitter, Jonathan, et al.
Publicado: (2025)

Cuts in Graphs with Matroid Constraints
por: Banik, Aritra, et al.
Publicado: (2024)

A Class of Unrooted Phylogenetic Networks Inspired by the Properties of Rooted Tree-Child Networks
por: van Iersel, Leo, et al.
Publicado: (2026)

Reconstructing semi-directed level-1 networks using few quarnets
por: Frohn, Martin, et al.
Publicado: (2024)

When are quarnets sufficient to reconstruct semi-directed phylogenetic networks?
por: Huber, Katharina T., et al.
Publicado: (2024)

Embedding phylogenetic trees in networks of low treewidth
por: van Iersel, Leo, et al.
Publicado: (2022)

On the Structural Parameterizations of 2-Club with Triangle Constraints
por: Jacob, Ashwin, et al.
Publicado: (2025)

Online Graph Coloring for $k$-Colorable Graphs
por: Kawarabayashi, Ken-ichi, et al.
Publicado: (2025)

On the Polynomial Kernelizations of Finding a Shortest Path with Positive Disjunctive Constraints
por: Bandopadhyay, Susobhan, et al.
Publicado: (2023)

Maximizing a Submodular Function with Bounded Curvature under an Unknown Knapsack Constraint
por: Klimm, Max, et al.
Publicado: (2022)

Taxonomic classification with maximal exact matches in KATKA kernels and minimizer digests
por: Draesslerová, Dominika, et al.
Publicado: (2024)

Snakes and Ladders: a Treewidth Story
por: Chaplick, Steven, et al.
Publicado: (2023)

Graph Visualization for Blockchain Data
por: Dietl, Marcell, et al.
Publicado: (2024)

Simplifying and Characterizing DAGs and Phylogenetic Networks via Least Common Ancestor Constraints
por: Lindeberg, Anna, et al.
Publicado: (2024)

Distance-Preserving Graph Compression Techniques
por: Madani, Amirali, et al.
Publicado: (2023)

Temporal Graph Realization With Bounded Stretch
por: Mertzios, George B., et al.
Publicado: (2025)

Triangle Detection in H-Free Graphs
por: Abboud, Amir, et al.
Publicado: (2025)

Colouring Probe $H$-Free Graphs
por: Paulusma, Daniël, et al.
Publicado: (2025)

Optimal Padded Decomposition For Bounded Treewidth Graphs
por: Filtser, Arnold, et al.
Publicado: (2024)

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

Optimal Enumeration of Eulerian Trails in Directed Graphs
por: Bals, Ben, et al.
Publicado: (2026)

FO and MSO Model Checking on Temporal Graphs
por: Döring, Michelle, et al.
Publicado: (2026)

Exact and Heuristic Computation of the Scanwidth of Directed Acyclic Graphs
por: Holtgrefe, Niels, et al.
Publicado: (2024)

Approximating Maximum Edge 2-Coloring by Normalizing Graphs
por: Mömke, Tobias, et al.
Publicado: (2024)

Subgraph Counting in Subquadratic Time for Bounded Degeneracy Graphs
por: Paul-Pena, Daniel, et al.
Publicado: (2024)

Algorithmic Results for Weak Roman Domination Problem in Graphs
por: Paul, Kaustav, et al.
Publicado: (2024)