Finding Maximum Common Biconnected Subgraphs in Series-Parallel Graphs (Q2922637)

From MaRDI portal
Revision as of 22:33, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
scientific article
Language Label Description Also known as
English
Finding Maximum Common Biconnected Subgraphs in Series-Parallel Graphs
scientific article

    Statements

    title
    Finding Maximum Common Biconnected Subgraphs in Series-Parallel Graphs (English)
    0 references
    author
    Nils M. Kriege
    0 references
    Petra Mutzel
    0 references
    publication date
    14 October 2014
    0 references
    zbMATH Keywords
    tree decomposition
    0 references
    maximum common subgraph
    0 references
    series-parallel graph
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68Q25
    0 references
    05C05
    0 references
    05C40
    0 references
    05C85
    0 references
    zbMATH DE Number
    6355340
    0 references
    OpenAlex ID
    W21966713
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2922637&oldid=32198755"
    Powered by MediaWiki