scientific article; zbMATH DE number 2038759
From MaRDI portal
Publication:4449224
zbMath1039.68092MaRDI QIDQ4449224
Ge Xia, Ljubomir Perković, Eric Sedgwick, Jian'er Chen, Iyad A. Kanj
Publication date: 8 February 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2719/27190845.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (2)
Genus characterizes the complexity of certain graph problems: Some tight results ⋮ Confronting intractability via parameters
This page was built for publication:
