Copertina

On the Polynomial Kernelizations of Finding a Shortest Path with Positive Disjunctive Constraints

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Bandopadhyay, Susobhan, Banerjee, Suman, Majumdar, Diptapriyo, Panolan, Fahad
Natura:	Preprint
Pubblicazione:	2023
Soggetti:	Discrete Mathematics Data Structures and Algorithms
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

On the Parameterized Tractability of Packing Vertex-Disjoint A-Paths with Length Constraints
di: Bandopadhyay, Susobhan, et al.
Pubblicazione: (2026)

Polynomial Kernels for Spanning Tree with Diversity Requirements
di: Golovach, Petr A., et al.
Pubblicazione: (2026)

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

A Polynomial Kernel for Deletion to the Scattered Class of Cliques and Trees
di: Jacob, Ashwin, et al.
Pubblicazione: (2024)

A Polynomial Kernel for Vertex Deletion to the Scattered Class of Proper Interval Graph and Trees
di: Jacob, Ashwin, et al.
Pubblicazione: (2026)

Parameterized Saga of First-Fit and Last-Fit Coloring
di: Agrawal, Akanksha, et al.
Pubblicazione: (2024)

The Parameterized Complexity of Vertex-Coloring Edge-Weighting
di: Aute, Shubhada, et al.
Pubblicazione: (2026)

Detecting Disjoint Shortest Paths in Linear Time and More
di: Akmal, Shyan, et al.
Pubblicazione: (2024)

Tight (Double) Exponential Bounds for Identification Problems: Locating-Dominating Set and Test Cover
di: Chakraborty, Dipayan, et al.
Pubblicazione: (2024)

Tightest Admissible Shortest Path
di: Weiss, Eyal, et al.
Pubblicazione: (2023)

Highly Connected Steiner Subgraph -- Parameterized Algorithms and Applications to Hitting Set Problems
di: Eiben, Eduard, et al.
Pubblicazione: (2023)

A Generalization of the Shortest Path Problem to Graphs with Multiple Edge-Cost Estimates
di: Weiss, Eyal, et al.
Pubblicazione: (2022)

A Sublinear Algorithm for Approximate Shortest Paths in Large Networks
di: Basu, Sabyasachi, et al.
Pubblicazione: (2024)

Hypergraph Connectivity Augmentation in Strongly Polynomial Time
di: Bérczi, Kristóf, et al.
Pubblicazione: (2024)

Enumeration Kernels of Polynomial Size for Cuts of Bounded Degree
di: Komusiewicz, Christian, et al.
Pubblicazione: (2023)

Prime Factorization of the Kirchhoff Polynomial: Compact Enumeration of Arborescences
di: Mihalák, Matúš, et al.
Pubblicazione: (2015)

A Polynomial Kernel for Face Cover on Non-Embedded Planar Graphs
di: Hamm, Thekla, et al.
Pubblicazione: (2026)

Output-Sensitive Enumeration of Potential Maximal Cliques in Polynomial Space
di: Brosse, Caroline, et al.
Pubblicazione: (2024)

(Almost-)Optimal FPT Algorithm and Kernel for $T$-Cycle on Planar Graphs
di: Gahlawat, Harmender, et al.
Pubblicazione: (2025)

Parameterized Complexity of Path Set Packing
di: Aravind, N. R., et al.
Pubblicazione: (2022)

How to Reduce Temporal Cliques to Find Sparse Spanners
di: Angrick, Sebastian, et al.
Pubblicazione: (2024)

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

Continuous Petri Nets for Fast Yield Computation: Polynomial-Time and MILP Approaches
di: Jordon, Addie, et al.
Pubblicazione: (2025)

Path Contraction Faster than $2^n$
di: Agrawal, Akanksha, et al.
Pubblicazione: (2025)

Polynomial-time algorithms for PATH COVER and PATH PARTITION on trees and graphs of bounded treewidth
di: Foucaud, Florent, et al.
Pubblicazione: (2025)

Tight Paths and Tight Pairs in Weighted Directed Graphs
di: Balcázar, José Luis
Pubblicazione: (2025)

Path Cover, Hamiltonicity, and Independence Number: An FPT Perspective
di: Fomin, Fedor V., et al.
Pubblicazione: (2024)

Strong Conflict-Free Vertex-Connection via Twin Cover: Kernelization and Chromatic Bounds
di: German, Samuel
Pubblicazione: (2026)

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

Efficient Online Sensitivity Analysis For The Injective Bottleneck Path Problem
di: Kaymakov, Kirill V., et al.
Pubblicazione: (2024)

Finding perfect matchings in bridgeless cubic multigraphs without dynamic (2-)connectivity
di: Gawrychowski, Paweł, et al.
Pubblicazione: (2024)

Fanciful Figurines flip Free Flood-It -- Polynomial-Time Miniature Painting on Co-gem-free Graphs
di: Rosenke, Christian, et al.
Pubblicazione: (2026)

Distance Recoloring
di: Banerjee, Niranka, et al.
Pubblicazione: (2024)

Minsum Problem for Discrete and Weighted Set Flow on Dynamic Path Network
di: Manna, Bubai, et al.
Pubblicazione: (2024)

Sampling Balanced Forests of Grids in Polynomial Time
di: Cannon, Sarah, et al.
Pubblicazione: (2023)

A Quadratic Vertex Kernel and a Subexponential Algorithm for Subset-FAST
di: Jana, Satyabrata, et al.
Pubblicazione: (2025)

A Polynomial-Time Approximation Algorithm for Complete Interval Minors
di: Bourneuf, Romain, et al.
Pubblicazione: (2025)

An Algebraic Approach to the Longest Path Problem
di: Khazali, Omar Al -
Pubblicazione: (2023)

Arborescences and Shortest Path Trees when Colors Matter
di: Ardra, P. S., et al.
Pubblicazione: (2024)

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