May 31, 2024Open Access

Exakte Algorithmen für MaxCut auf gespaltenen Graphen

Key Points

Key points are not available for this paper at this time.

Abstract

In diesem Papier wird ein O^* (1. 42^n) Zeitalgorithmus für das Maximum-Cut-Problem auf gespaltenen Graphen vorgestellt, sowie ein subexponentialer Zeitalgorithmus für die Entscheidungsvariante.

Read Full Paperexternally

KI fragen

Bookmark

View Full Paper

Cite This Study

Marko Lalovic (Fri,) untersuchte diese Frage.

synapsesocial.com/papers/68e6785bb6db6435876029ae https://doi.org/https://doi.org/10.48550/arxiv.2405.20599

Also Consider

Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:

1Linear-Time MaxCut in Multigraphs Parameterized Above the Poljak-Turzík Bound2024
2An approximation algorithm for Maximum DiCut vs. Cut2024
3Efficient enumeration of maximal split subgraphs and induced sub-cographs and related classes2023 · 2 citations
4A Faster Algorithm for Independent Cut2025
5Breaking the O(mn)-Time Barrier for Vertex-Weighted Global Minimum Cut2025

KI fragen

Bookmark

View Full Paper