scientific article; zbMATH DE number 2044511

zbMath1042.68605MaRDI QIDQ4448375

Gerd Wechsung, Jörg Rothe, André Große

Publication date: 18 February 2004

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2202/22020339.htm

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

zbMATH Keywords

Hamiltonian cyclespartial solutionsgraph colorabilityself-reducibilitygraph isomorphismscomplexity of smallest solutions

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

Computing graph automorphism from partial solutions

This page was built for publication: