Algorithms for \(\mathcal{GA}\mathrm{-}\mathcal H\) reduced graphs (Q891818)

From MaRDI portal
Revision as of 20:28, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Algorithms for \(\mathcal{GA}\mathrm{-}\mathcal H\) reduced graphs
scientific article

    Statements

    Algorithms for \(\mathcal{GA}\mathrm{-}\mathcal H\) reduced graphs (English)
    0 references
    0 references
    17 November 2015
    0 references
    0 references
    graph algorithm
    0 references
    \(\mathcal{H}\)-mixed graph
    0 references
    subgraph overlap graph
    0 references
    subtree filament graph
    0 references
    maximum independent set
    0 references
    0 references