Maximum $r$-Regular Induced Subgraph Problem: Fast Exponential Algorithms and Combinatorial Bounds (Q4915198)

From MaRDI portal
Revision as of 10:01, 13 November 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 6152410
Language Label Description Also known as
English
Maximum $r$-Regular Induced Subgraph Problem: Fast Exponential Algorithms and Combinatorial Bounds
scientific article; zbMATH DE number 6152410

    Statements

    Maximum $r$-Regular Induced Subgraph Problem: Fast Exponential Algorithms and Combinatorial Bounds (English)
    0 references
    0 references
    0 references
    0 references
    9 April 2013
    0 references
    maximal \(r\)-regular subgraphs
    0 references
    combinatorial upper and lower bounds
    0 references
    exact exponential time algorithms
    0 references

    Identifiers

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