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

From MaRDI portal
scientific article
Language Label Description Also known as
English
Finding Maximum Common Biconnected Subgraphs in Series-Parallel Graphs
scientific article

    Statements

    Finding Maximum Common Biconnected Subgraphs in Series-Parallel Graphs (English)
    0 references
    0 references
    0 references
    14 October 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    tree decomposition
    0 references
    maximum common subgraph
    0 references
    series-parallel graph
    0 references
    0 references
    0 references