Q4944972
type: Item
instance of: scholarly article
zbMATH Open document ID: 0941.05061
author: Öjvind Johansson
publication date: 2000-05-22T00:00:00Z
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C78
zbMATH DE Number: 1420903
zbMATH Keywords: vertex-labeled graphs
zbMATH Keywords: decomposition
zbMATH Keywords: labels
zbMATH Keywords: dynamic programming
zbMATH Keywords: algorithm
MaRDI profile type: MaRDI publication profile
Recommended article: NLC2-DECOMPOSITION IN POLYNOMIAL TIME
Recommended article: Q4448762
Recommended article: \(k\)-NLC graphs and polynomial algorithms
Recommended article: Polynomial Decompositions in Polynomial Time
Recommended article: General polynomial decomposition and the s-1-decomposition are NP-Hard
Recommended article: An \(O(n^{lg\,k}\cdot 2^{n/2})\) time and \(O(k\cdot 2^{n/k})\) space algorithm for certain NP-complete problems
Recommended article: Q4234180
Recommended article: An O(n2) Algorithm for Undirected Split Decomposition
Recommended article: On a polytime factorization algorithm for multilinear polynomials over \(\mathbb{F}_2\)
Recommended article: Q3680278
description: scientific article; zbMATH DE number 1420903