Imagen de Portada

One Color Makes All the Difference in the Tractability of Partial Coloring in Semi-Streaming

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Das, Avinandan
Formato:	Preprint
Publicado:	2026
Materias:	Data Structures and Algorithms Computational Complexity Discrete Mathematics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

Parameterized Complexity of Streaming Diameter and Connectivity Problems
por: Oostveen, Jelle J., et al.
Publicado: (2022)

The parameterized complexity of Strong Conflict-Free Vertex-Connection Colorability
por: Feghali, Carl, et al.
Publicado: (2025)

Multi-Pass Streaming Lower Bounds for Approximating Max-Cut
por: Fei, Yumou, et al.
Publicado: (2025)

1-in-3 vs. Not-All-Equal: Dichotomy of a broken promise
por: Ciardo, Lorenzo, et al.
Publicado: (2023)

Solving NP-hard Problems on \textsc{GaTEx} Graphs: Linear-Time Algorithms for Perfect Orderings, Cliques, Colorings, and Independent Sets
por: Hellmuth, Marc, et al.
Publicado: (2023)

Computing Hamiltonian Paths with Partial Order Restrictions
por: Beisegel, Jesse, et al.
Publicado: (2024)

A Graph Width Perspective on Partially Ordered Hamiltonian Paths
por: Beisegel, Jesse, et al.
Publicado: (2025)

Color-Constrained Arborescences in Edge-Colored Digraphs
por: Ardra, P. S., et al.
Publicado: (2025)

A Graph Width Perspective on Partially Ordered Hamiltonian Paths and Cycles II: Vertex and Edge Deletion Numbers
por: Beisegel, Jesse, et al.
Publicado: (2025)

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

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

(Independent) Roman Domination Parameterized by Distance to Cluster
por: Ashok, Pradeesha, et al.
Publicado: (2024)

A note on approximating the average degree of bounded arboricity graphs
por: Eden, Talya, et al.
Publicado: (2026)

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

Breadth-First Search Trees with Many or Few Leaves
por: Beisegel, Jesse, et al.
Publicado: (2026)

On the parameterized complexity of Broadcast Independence and Broadcast Packing
por: Dumont, Joanne, et al.
Publicado: (2026)

The Parameterized Complexity of Independent Set and More when Excluding a Half-Graph, Co-Matching, or Matching
por: Dreier, Jan, et al.
Publicado: (2026)

Finding Minimum Distance Preservers: A Parameterized Study
por: Simonov, Kirill, et al.
Publicado: (2026)

$O(n +f(k))$: Truly Linear FPT
por: Bumpus, Benjamin Merlin, et al.
Publicado: (2026)

Microscopic Structure of Random 3-SAT: A Discrete Geometric Approach to Phase Transitions and Algorithmic Complexity
por: Zhan, Yongjian
Publicado: (2026)

Bipartite Exact Matching in P
por: Du, Yuefeng
Publicado: (2026)

Relative-error unateness testing
por: Chen, Xi, et al.
Publicado: (2025)

Refining the Complexity Landscape of Speed Scaling: Hardness and Algorithms
por: Antoniadis, Antonios, et al.
Publicado: (2025)

Parameterised distance to local irregularity
por: Fioravantes, Foivos, et al.
Publicado: (2023)

A Strongly Polynomial-Time Algorithm for Weighted General Factors with Three Feasible Degrees
por: Shao, Shuai, et al.
Publicado: (2023)

Optimal PSPACE-hardness of Approximating Set Cover Reconfiguration
por: Hirahara, Shuichi, et al.
Publicado: (2024)

On Approximate Reconfigurability of Label Cover
por: Ohsaka, Naoto
Publicado: (2023)

Problems in NP can Admit Double-Exponential Lower Bounds when Parameterized by Treewidth or Vertex Cover
por: Foucaud, Florent, et al.
Publicado: (2023)

Counting Locally Optimal Tours in the TSP
por: Manthey, Bodo, et al.
Publicado: (2024)

Relative-error testing of conjunctions and decision lists
por: Chen, Xi, et al.
Publicado: (2025)

On Stable Cutsets in General and Minimum Degree Constrained Graphs
por: Vroon, Mats, et al.
Publicado: (2025)

Placing Green Bridges Optimally, with a Multivariate Analysis
por: Fluschnik, Till, et al.
Publicado: (2021)

Finding a Minimum Spanning Tree with a Small Non-Terminal Set
por: Hanaka, Tesshu, et al.
Publicado: (2023)

Relative-error monotonicity testing
por: Chen, Xi, et al.
Publicado: (2024)

Edge Multiway Cut and Node Multiway Cut are NP-complete on subcubic graphs
por: Johnson, Matthew, et al.
Publicado: (2022)

Linear-Time MaxCut in Multigraphs Parameterized Above the Poljak-Turzík Bound
por: Lill, Jonas, et al.
Publicado: (2024)

Maximum $k$- vs. $\ell$-colourings of graphs
por: Nakajima, Tamio-Vesa, et al.
Publicado: (2023)

Probabilistically Checkable Reconfiguration Proofs and Inapproximability of Reconfiguration Problems
por: Hirahara, Shuichi, et al.
Publicado: (2023)

On the Constant-Factor Approximability of Minimum Cost Constraint Satisfaction Problems
por: DeHaan, Ian, et al.
Publicado: (2025)