scientific article; zbMATH DE number 1420903
From MaRDI portal
Publication:4944972
zbMATH Open0941.05061MaRDI QIDQ4944972
Publication date: 22 May 2000
Title of this publication is not available (Why is that?)
Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85)
Recommendations
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- An \(O(n^{lg\,k}\cdot 2^{n/2})\) time and \(O(k\cdot 2^{n/k})\) space algorithm for certain NP-complete problems 👍 👎
- \(k\)-NLC graphs and polynomial algorithms 👍 👎
- On a polytime factorization algorithm for multilinear polynomials over \(\mathbb{F}_2\) 👍 👎
- Polynomial Decompositions in Polynomial Time 👍 👎
- General polynomial decomposition and the s-1-decomposition are NP-Hard 👍 👎
- An O(n2) Algorithm for Undirected Split Decomposition 👍 👎
- NLC2-DECOMPOSITION IN POLYNOMIAL TIME 👍 👎
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4944972)
