On maximum common subgraph problems in series-parallel graphs (Q1678090): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ejc.2017.07.012 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2963589575 / rank
 
Normal rank

Revision as of 22:27, 19 March 2024

scientific article
Language Label Description Also known as
English
On maximum common subgraph problems in series-parallel graphs
scientific article

    Statements

    On maximum common subgraph problems in series-parallel graphs (English)
    0 references
    0 references
    0 references
    0 references
    14 November 2017
    0 references
    series-parallel graphs
    0 references
    polynomial time algorithm
    0 references

    Identifiers

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