Copertina

Parameterized Complexity of Streaming Diameter and Connectivity Problems

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Oostveen, Jelle J., van Leeuwen, Erik Jan
Natura:	Preprint
Pubblicazione:	2022
Soggetti:	Data Structures and Algorithms Computational Complexity Discrete Mathematics
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

The Complexity of Diameter on H-free graphs
di: Oostveen, Jelle J., et al.
Pubblicazione: (2024)

Computing Subset Vertex Covers in $H$-Free Graphs
di: Brettell, Nick, et al.
Pubblicazione: (2023)

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

On the Parameterized Complexity of Grundy Domination and Zero Forcing Problems
di: Scheffler, Robert
Pubblicazione: (2025)

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

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

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

Steiner Forest for $H$-Subgraph-Free Graphs
di: Eagling-Vose, Tala, et al.
Pubblicazione: (2026)

Parameterized Complexity of (d,r)-Domination via Modular Decomposition
di: Cordasco, Gennaro, et al.
Pubblicazione: (2024)

Combinatorial Parameterized Algorithms for Chemical Descriptors based on Molecular Graph Sparsity
di: Conrado, Giovanna K., et al.
Pubblicazione: (2023)

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

Metric Dimension and Geodetic Set Parameterized by Vertex Cover
di: Foucaud, Florent, et al.
Pubblicazione: (2024)

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

U-Bubble Model for Mixed Unit Interval Graphs and its Applications: The MaxCut Problem Revisited
di: Kratochvíl, Jan, et al.
Pubblicazione: (2020)

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

Complexity of the (Connected) Cluster Vertex Deletion problem on $H$-free graphs
di: Le, Hoang-Oanh, et al.
Pubblicazione: (2024)

Dichotomies for Maximum Matching Cut: $H$-Freeness, Bounded Diameter, Bounded Radius
di: Lucke, Felicia, et al.
Pubblicazione: (2023)

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

One Color Makes All the Difference in the Tractability of Partial Coloring in Semi-Streaming
di: Das, Avinandan
Pubblicazione: (2026)

Alphabet Reduction for Reconfiguration Problems
di: Ohsaka, Naoto
Pubblicazione: (2024)

Finding d-Cuts in Graphs of Bounded Diameter, Graphs of Bounded Radius and H-Free Graphs
di: Lucke, Felicia, et al.
Pubblicazione: (2024)

The Days On Days Off Scheduling Problem
di: Nießen, Fabien, et al.
Pubblicazione: (2024)

The Complexity of Transitively Orienting Temporal Graphs
di: Mertzios, George B., et al.
Pubblicazione: (2021)

The Complexity of Cluster Vertex Splitting and Company
di: Firbas, Alexander, et al.
Pubblicazione: (2023)

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

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

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

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

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

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

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

Graph Search Trees and the Intermezzo Problem
di: Beisegel, Jesse, et al.
Pubblicazione: (2024)

Space Efficient Algorithms for Parameterised Problems
di: Akhtar, Sheikh Shakil, et al.
Pubblicazione: (2025)

A Fixed-Parameter Algorithm for the Kneser Problem
di: Haviv, Ishay
Pubblicazione: (2022)

Parameterized Complexity of s-Club Cluster Edge Deletion: When Is the Diameter Bound Necessary?
di: Gaikwad, Ajinkya
Pubblicazione: (2025)

Solving Problems on Generalized Convex Graphs via Mim-Width
di: Bonomo-Braberman, Flavia, et al.
Pubblicazione: (2020)

Colouring Graphs Without a Subdivided H-Graph: A Full Complexity Classification
di: Eagling-Vose, Tala, et al.
Pubblicazione: (2025)

On the complexity of symmetric vs. functional PCSPs
di: Nakajima, Tamio-Vesa, et al.
Pubblicazione: (2022)

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

Relative-error unateness testing
di: Chen, Xi, et al.
Pubblicazione: (2025)