Matches in SemOpenAlex for { <https://semopenalex.org/work/W3120331443> ?p ?o ?g. }
- W3120331443 endingPage "1458" @default.
- W3120331443 startingPage "1421" @default.
- W3120331443 abstract "The cut-set $$partial (S)$$ of a graph $$G=(V,E)$$ is the set of edges that have one endpoint in $$Ssubset V$$ and the other endpoint in $$Vsetminus S$$ , and whenever G[S] is connected, the cut $$[S,Vsetminus S]$$ of G is called a connected cut. A bond of a graph G is an inclusion-wise minimal disconnecting set of G, i.e., bonds are cut-sets that determine cuts $$[S,Vsetminus S]$$ of G such that G[S] and $$G[Vsetminus S]$$ are both connected. Contrasting with a large number of studies related to maximum cuts, there exist very few results regarding the largest bond of general graphs. In this paper, we aim to reduce this gap on the complexity of computing the largest bond, and the maximum connected cut of a graph. Although cuts and bonds are similar, we remark that computing the largest bond and the maximum connected cut of a graph tends to be harder than computing its maximum cut. We show that it does not exist a constant-factor approximation algorithm to compute the largest bond, unless $$text{ P }= text{ NP }$$ . Also, we show that Largest Bond and Maximum Connected Cut are NP-hard even for planar bipartite graphs, whereas Maximum Cut is trivial on bipartite graphs and polynomial-time solvable on planar graphs. In addition, we show that Largest Bond and Maximum Connected Cut are NP-hard on split graphs, and restricted to graphs of clique-width w they can not be solved in time $$f(w) n^{{o}(w)}$$ unless the Exponential Time Hypothesis fails, but they can be solved in time $$f(w) n^{{O}(w)}$$ . Finally, we show that both problems are fixed-parameter tractable when parameterized by the size of the solution, the treewidth, and the twin-cover number." @default.
- W3120331443 created "2021-01-18" @default.
- W3120331443 creator A5003248242 @default.
- W3120331443 creator A5017896061 @default.
- W3120331443 creator A5024675233 @default.
- W3120331443 creator A5036130363 @default.
- W3120331443 creator A5036752449 @default.
- W3120331443 creator A5036853466 @default.
- W3120331443 creator A5038531405 @default.
- W3120331443 creator A5074548000 @default.
- W3120331443 creator A5077019769 @default.
- W3120331443 date "2021-01-08" @default.
- W3120331443 modified "2023-10-18" @default.
- W3120331443 title "Computing the Largest Bond and the Maximum Connected Cut of a Graph" @default.
- W3120331443 cites W1509309803 @default.
- W3120331443 cites W1587939554 @default.
- W3120331443 cites W1709205181 @default.
- W3120331443 cites W1968988491 @default.
- W3120331443 cites W1985123706 @default.
- W3120331443 cites W1988133548 @default.
- W3120331443 cites W1993328543 @default.
- W3120331443 cites W1999145171 @default.
- W3120331443 cites W2006933117 @default.
- W3120331443 cites W2033447978 @default.
- W3120331443 cites W2053991811 @default.
- W3120331443 cites W2057826895 @default.
- W3120331443 cites W2059273723 @default.
- W3120331443 cites W2064530627 @default.
- W3120331443 cites W2071629762 @default.
- W3120331443 cites W2073705438 @default.
- W3120331443 cites W2079306871 @default.
- W3120331443 cites W2087038607 @default.
- W3120331443 cites W2087818742 @default.
- W3120331443 cites W2097277086 @default.
- W3120331443 cites W2102159495 @default.
- W3120331443 cites W2105408747 @default.
- W3120331443 cites W2106233458 @default.
- W3120331443 cites W2115049345 @default.
- W3120331443 cites W2147899407 @default.
- W3120331443 cites W2149342630 @default.
- W3120331443 cites W2150408365 @default.
- W3120331443 cites W2165348883 @default.
- W3120331443 cites W2170458234 @default.
- W3120331443 cites W2172910202 @default.
- W3120331443 cites W2601673779 @default.
- W3120331443 cites W2610479830 @default.
- W3120331443 cites W2611730178 @default.
- W3120331443 cites W2625060274 @default.
- W3120331443 cites W2626890420 @default.
- W3120331443 cites W2767174160 @default.
- W3120331443 cites W2770631757 @default.
- W3120331443 cites W2899702797 @default.
- W3120331443 cites W2914414140 @default.
- W3120331443 cites W2963170238 @default.
- W3120331443 cites W2963310954 @default.
- W3120331443 cites W4238591275 @default.
- W3120331443 cites W4238913085 @default.
- W3120331443 doi "https://doi.org/10.1007/s00453-020-00789-1" @default.
- W3120331443 hasPublicationYear "2021" @default.
- W3120331443 type Work @default.
- W3120331443 sameAs 3120331443 @default.
- W3120331443 citedByCount "1" @default.
- W3120331443 countsByYear W31203314432022 @default.
- W3120331443 crossrefType "journal-article" @default.
- W3120331443 hasAuthorship W3120331443A5003248242 @default.
- W3120331443 hasAuthorship W3120331443A5017896061 @default.
- W3120331443 hasAuthorship W3120331443A5024675233 @default.
- W3120331443 hasAuthorship W3120331443A5036130363 @default.
- W3120331443 hasAuthorship W3120331443A5036752449 @default.
- W3120331443 hasAuthorship W3120331443A5036853466 @default.
- W3120331443 hasAuthorship W3120331443A5038531405 @default.
- W3120331443 hasAuthorship W3120331443A5074548000 @default.
- W3120331443 hasAuthorship W3120331443A5077019769 @default.
- W3120331443 hasBestOaLocation W31203314432 @default.
- W3120331443 hasConcept C101837359 @default.
- W3120331443 hasConcept C114614502 @default.
- W3120331443 hasConcept C118615104 @default.
- W3120331443 hasConcept C132525143 @default.
- W3120331443 hasConcept C134119311 @default.
- W3120331443 hasConcept C165526019 @default.
- W3120331443 hasConcept C197657726 @default.
- W3120331443 hasConcept C311688 @default.
- W3120331443 hasConcept C33923547 @default.
- W3120331443 hasConceptScore W3120331443C101837359 @default.
- W3120331443 hasConceptScore W3120331443C114614502 @default.
- W3120331443 hasConceptScore W3120331443C118615104 @default.
- W3120331443 hasConceptScore W3120331443C132525143 @default.
- W3120331443 hasConceptScore W3120331443C134119311 @default.
- W3120331443 hasConceptScore W3120331443C165526019 @default.
- W3120331443 hasConceptScore W3120331443C197657726 @default.
- W3120331443 hasConceptScore W3120331443C311688 @default.
- W3120331443 hasConceptScore W3120331443C33923547 @default.
- W3120331443 hasFunder F4320320997 @default.
- W3120331443 hasFunder F4320322025 @default.
- W3120331443 hasFunder F4320334764 @default.
- W3120331443 hasFunder F4320338075 @default.
- W3120331443 hasIssue "5" @default.
- W3120331443 hasLocation W31203314431 @default.