Minimum feedback vertex sets in cocomparability graphs and complex bipartite graphs (Q1920227)

From MaRDI portal
Revision as of 05:14, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Minimum feedback vertex sets in cocomparability graphs and complex bipartite graphs
scientific article

    Statements

    Minimum feedback vertex sets in cocomparability graphs and complex bipartite graphs (English)
    0 references
    0 references
    0 references
    19 June 1997
    0 references
    Polynomial-time algorithms for the feedback vertex set problem in cocomparability graphs and complex bipartite graphs are presented.
    0 references
    polynomial-time algorithms
    0 references
    feedback vertex set
    0 references
    cocomparability graphs
    0 references
    complex bipartite graphs
    0 references

    Identifiers