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

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q814930
RedirectionBot (talk | contribs)
Changed an Item
Property / author
 
Property / author: Hoàng-Oanh Le / rank
 
Normal rank

Revision as of 08:18, 21 February 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