Image de couverture de livre

On the parameterized complexity of computing good edge-labelings

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	de Andrade, Davi, Araújo, Júlio, Morelle, Laure, Sau, Ignasi, Silva, Ana
Format:	Preprint
Publié:	2024
Sujets:	Data Structures and Algorithms Computational Complexity 05C85, 05C10 G.2.2; G.2.3
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Faster parameterized algorithms for modification problems to minor-closed classes
par: Morelle, Laure, et autres
Publié: (2022)

Kernelization dichotomies for hitting minors under structural parameterizations
par: Bougeret, Marin, et autres
Publié: (2025)

Vertex identification to a forest
par: Morelle, Laure, et autres
Publié: (2024)

Graph modification of bounded size to minor-closed classes as fast as vertex deletion
par: Morelle, Laure, et autres
Publié: (2025)

Kernelization Dichotomies for Hitting Subgraphs under Structural Parameterizations
par: Bougeret, Marin, et autres
Publié: (2024)

Dynamic programming on bipartite tree decompositions
par: Jaffke, Lars, et autres
Publié: (2023)

Identification to Subclasses of Chordal Graphs
par: Golovach, Petr A., et autres
Publié: (2026)

Computing distances is FPT on graph associahedra and W[2]-hard on hypergraphic polytopes
par: Cunha, Luís Felipe I., et autres
Publié: (2025)

Maximum Weight Independent Set in Graphs with no Long Claws in Quasi-Polynomial Time
par: Gartland, Peter, et autres
Publié: (2023)

Finding Diverse Minimum s-t Cuts
par: de Berg, Mark, et autres
Publié: (2023)

Proper colorings of a graph in linear time using a number of colors linear in the maximum degree of the graph
par: Bhandari, Kritika, et autres
Publié: (2025)

Parameterizing the quantification of CMSO: model checking on minor-closed graph classes
par: Sau, Ignasi, et autres
Publié: (2024)

Dynamic Traffic Assignment for Public Transport with Vehicle Capacities
par: Patzner, Julian, et autres
Publié: (2024)

A New Temporal Interpretation of Cluster Editing
par: Bocci, Cristiano, et autres
Publié: (2022)

Optimal Path Partitions in Subcubic and Almost-subcubic Graphs
par: Masařík, Tomáš, et autres
Publié: (2026)

Cluster Before You Hallucinate: Approximating Node-Capacitated Network Design and Energy Efficient Routing
par: Krishnaswamy, Ravishankar, et autres
Publié: (2014)

Shortest two disjoint paths in conservative graphs
par: Schlotter, Ildikó
Publié: (2023)

State Canonization and Early Pruning in Width-Based Automated Theorem Proving
par: Oliveira, Mateus de Oliveira, et autres
Publié: (2026)

Excluding a Forest Induced Minor
par: Bonnet, Édouard, et autres
Publié: (2025)

m-Eternal Domination and Variants on Some Classes of Finite and Infinite Graphs
par: Calamoneri, Tiziana, et autres
Publié: (2025)

The Minimum Eternal Vertex Cover Problem on a Subclass of Series-Parallel Graphs
par: Calamoneri, Tiziana, et autres
Publié: (2025)

On the MST-ratio: Theoretical Bounds and Complexity of Finding the Maximum
par: Ameli, Afrouz Jabal, et autres
Publié: (2024)

How quickly can you pack short paths? Engineering a search-tree algorithm for disjoint s-t paths of bounded length
par: Huber, Michael Kiran
Publié: (2024)

Exploration of $k$-edge-deficient temporal graphs in linear time
par: Lahtin, Ivan, et autres
Publié: (2026)

Traffic-Oblivious Multi-Commodity Flow Network Design
par: Chimani, Markus, et autres
Publié: (2025)

Tree-independence number VI. Thetas and pyramids
par: Chudnovsky, Maria, et autres
Publié: (2025)

Excluding Pinched Spheres
par: Morelle, Laure, et autres
Publié: (2025)

Finding irrelevant vertices in linear time on bounded-genus graphs
par: Golovach, Petr A., et autres
Publié: (2019)

A Constant-factor Approximation for Weighted Bond Cover
par: Kim, Eun Jung, et autres
Publié: (2021)

Temporalizing digraphs via linear-size balanced bi-trees
par: Bessy, Stéphane, et autres
Publié: (2023)

Obstructions to Erdős-Pósa Dualities for Minors
par: Paul, Christophe, et autres
Publié: (2024)

Killing a Vortex
par: Thilikos, Dimitrios M., et autres
Publié: (2022)

An algorithmic Vizing's theorem: toward efficient edge-coloring sampling with an optimal number of colors
par: De Meyer, Lucas, et autres
Publié: (2025)

Exact Algorithms for MaxCut on Split Graphs
par: Lalovic, Marko
Publié: (2024)

Low Recourse Arborescence Forests Under Uniformly Random Arcs
par: Dahlmeier, J Niklas, et autres
Publié: (2025)

ARRIVAL: Recursive Framework & $\ell_1$-Contraction
par: Haslebacher, Sebastian
Publié: (2025)

Cluster deletion and clique partitioning in graphs with bounded clique number
par: Galesi, Nicola, et autres
Publié: (2025)

TreePIR: Efficient Private Retrieval of Merkle Proofs via Tree Colorings with Fast Indexing and Zero Storage Overhead
par: Dau, Son Hoang, et autres
Publié: (2022)

Chromatic Feature Vectors for 2-Trees: Exact Formulas for Partition Enumeration with Network Applications
par: Allagan, J., et autres
Publié: (2025)

Optimal Bounds for the k-Disjoint Paths Problem
par: Cavallaro, Dario, et autres
Publié: (2026)