scientific article

From MaRDI portal

Revision as of 14:30, 5 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3804190

Jump to:navigation, search

zbMath0656.68046MaRDI QIDQ3804190

Maciej M. Sysło, Andrzej Lingas

Publication date: 1988

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

isomorphism subgraph series-parallel graph efficient algorithm random NC

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Related Items (6)

Sequential and parallel algorithms for embedding problems on classes of partial k-trees ⋮ Subgraph isomorphism, log-bounded fragmentation, and graphs of (locally) bounded treewidth ⋮ Maximum packing for biconnected outerplanar graphs ⋮ Maximum packing for \(k\)-connected partial \(k\)-trees in polynomial time ⋮ The complexity of subgraph isomorphism for classes of partial k-trees ⋮ On the isomorphism of expressions

This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3804190&oldid=17376122"