A complexity dichotomy for matching cut in (bipartite) graphs of fixed diameter (Q1740696): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2018.10.029 / rank
Normal rank
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W2798321768 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1804.11102 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Good edge-labelling of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Easy problems for tree-decomposable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for testing the truth of certain quantified Boolean formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of the matching-cut problem for planar graphs and other graph classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching cutsets in graphs of diameter 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing decomposable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Computing Procedure for Quantification Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subgraph Isomorphism in Planar Graphs and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diameter and treewidth in minor-closed graph families / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Timetable and Multicommodity Flow Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Networks immune to isolated line failures / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON PRIMITIVE GRAPHS AND OPTIMAL VERTEX ASSIGNMENTS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms solving the matching cut problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4636534 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On stable cutsets in line graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching cutsets in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4448767 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q129037185 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2018.10.029 / rank
 
Normal rank

Latest revision as of 07:23, 11 December 2024

scientific article
Language Label Description Also known as
English
A complexity dichotomy for matching cut in (bipartite) graphs of fixed diameter
scientific article

    Statements

    A complexity dichotomy for matching cut in (bipartite) graphs of fixed diameter (English)
    0 references
    0 references
    0 references
    2 May 2019
    0 references
    matching cut
    0 references
    NP-hardness
    0 references
    graph algorithm
    0 references
    computational complexity
    0 references
    dichotomy theorem
    0 references
    decomposable graph
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references