Publication:3804190
From MaRDI portal
zbMath0656.68046MaRDI QIDQ3804190
Andrzej Lingas, Maciej M. Sysło
Publication date: 1988
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
Related Items
The complexity of subgraph isomorphism for classes of partial k-trees, Subgraph isomorphism, log-bounded fragmentation, and graphs of (locally) bounded treewidth, On the isomorphism of expressions, Maximum packing for biconnected outerplanar graphs, Maximum packing for \(k\)-connected partial \(k\)-trees in polynomial time