Image de couverture de livre

U-Bubble Model for Mixed Unit Interval Graphs and its Applications: The MaxCut Problem Revisited

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Kratochvíl, Jan, Masařík, Tomáš, Novotná, Jana
Format:	Preprint
Publié:	2020
Sujets:	Data Structures and Algorithms Computational Complexity Discrete Mathematics
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Linear-Time MaxCut in Multigraphs Parameterized Above the Poljak-Turzík Bound
par: Lill, Jonas, et autres
Publié: (2024)

Max Weight Independent Set in graphs with no long claws: An analog of the Gyárfás' path argument
par: Majewski, Konrad, et autres
Publié: (2022)

Multi-Pass Streaming Lower Bounds for Approximating Max-Cut
par: Fei, Yumou, et autres
Publié: (2025)

Edge Multiway Cut and Node Multiway Cut are NP-complete on subcubic graphs
par: Johnson, Matthew, et autres
Publié: (2022)

The Simultaneous Interval Number: A New Width Parameter that Measures the Similarity to Interval Graphs
par: Beisegel, Jesse, et autres
Publié: (2024)

Finding $d$-Cuts in Probe $H$-Free Graphs
par: Dabrowski, Konrad K., et autres
Publié: (2025)

Finding d-Cuts in Graphs of Bounded Diameter, Graphs of Bounded Radius and H-Free Graphs
par: Lucke, Felicia, et autres
Publié: (2024)

Parameterized Complexity of Streaming Diameter and Connectivity Problems
par: Oostveen, Jelle J., et autres
Publié: (2022)

Asymptotically Optimal Inapproximability of Maxmin $k$-Cut Reconfiguration
par: Hirahara, Shuichi, et autres
Publié: (2024)

The Parameterized Complexity of Independent Set and More when Excluding a Half-Graph, Co-Matching, or Matching
par: Dreier, Jan, et autres
Publié: (2026)

Graph Search Trees and the Intermezzo Problem
par: Beisegel, Jesse, et autres
Publié: (2024)

Alphabet Reduction for Reconfiguration Problems
par: Ohsaka, Naoto
Publié: (2024)

The Days On Days Off Scheduling Problem
par: Nießen, Fabien, et autres
Publié: (2024)

Solving Problems on Generalized Convex Graphs via Mim-Width
par: Bonomo-Braberman, Flavia, et autres
Publié: (2020)

Probabilistically Checkable Reconfiguration Proofs and Inapproximability of Reconfiguration Problems
par: Hirahara, Shuichi, et autres
Publié: (2023)

On the Constant-Factor Approximability of Minimum Cost Constraint Satisfaction Problems
par: DeHaan, Ian, et autres
Publié: (2025)

The Complexity of Transitively Orienting Temporal Graphs
par: Mertzios, George B., et autres
Publié: (2021)

A Dichotomy for Maximum PCSPs on Graphs
par: Nakajima, Tamio-Vesa, et autres
Publié: (2024)

Randomized Communication and Implicit Graph Representations
par: Harms, Nathaniel, et autres
Publié: (2021)

Tight (Double) Exponential Bounds for Identification Problems: Locating-Dominating Set and Test Cover
par: Chakraborty, Dipayan, et autres
Publié: (2024)

On Stable Cutsets in General and Minimum Degree Constrained Graphs
par: Vroon, Mats, et autres
Publié: (2025)

Dichotomies for Maximum Matching Cut: $H$-Freeness, Bounded Diameter, Bounded Radius
par: Lucke, Felicia, et autres
Publié: (2023)

Problems in NP can Admit Double-Exponential Lower Bounds when Parameterized by Treewidth or Vertex Cover
par: Foucaud, Florent, et autres
Publié: (2023)

A Polynomial Kernel for Face Cover on Non-Embedded Planar Graphs
par: Hamm, Thekla, et autres
Publié: (2026)

Combinatorial Parameterized Algorithms for Chemical Descriptors based on Molecular Graph Sparsity
par: Conrado, Giovanna K., et autres
Publié: (2023)

On 3-Coloring of $(2P_4,C_5)$-Free Graphs
par: Jelínek, Vít, et autres
Publié: (2020)

Computing Subset Vertex Covers in $H$-Free Graphs
par: Brettell, Nick, et autres
Publié: (2023)

Steiner Forest for $H$-Subgraph-Free Graphs
par: Eagling-Vose, Tala, et autres
Publié: (2026)

Solving NP-hard Problems on \textsc{GaTEx} Graphs: Linear-Time Algorithms for Perfect Orderings, Cliques, Colorings, and Independent Sets
par: Hellmuth, Marc, et autres
Publié: (2023)

Space Efficient Algorithms for Parameterised Problems
par: Akhtar, Sheikh Shakil, et autres
Publié: (2025)

A Fixed-Parameter Algorithm for the Kneser Problem
par: Haviv, Ishay
Publié: (2022)

On the Parameterized Complexity of Grundy Domination and Zero Forcing Problems
par: Scheffler, Robert
Publié: (2025)

Colouring Graphs Without a Subdivided H-Graph: A Full Complexity Classification
par: Eagling-Vose, Tala, et autres
Publié: (2025)

The tape reconfiguration problem and its consequences for dominating set reconfiguration
par: Bousquet, Nicolas, et autres
Publié: (2025)

A Graph Width Perspective on Partially Ordered Hamiltonian Paths and Cycles I: Treewidth, Pathwidth, and Grid Graphs
par: Beisegel, Jesse, et autres
Publié: (2025)

Graph Classes Closed under Self-intersection
par: Dabrowski, Konrad K., et autres
Publié: (2025)

Optimal b-Colourings and Fall Colourings in $H$-Free Graphs
par: Ahn, Jungho, et autres
Publié: (2026)

A Graph Width Perspective on Partially Ordered Hamiltonian Paths
par: Beisegel, Jesse, et autres
Publié: (2025)

Colouring $(P_r+P_s)$-Free Graphs
par: Klimošová, Tereza, et autres
Publié: (2018)

A note on approximating the average degree of bounded arboricity graphs
par: Eden, Talya, et autres
Publié: (2026)