scientific article; zbMATH DE number 2038757

zbMath1039.68094MaRDI QIDQ4449222

Daniël Paulusma, Jiří Fiala

Publication date: 8 February 2004

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

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

zbMATH Keywords

computational complexitygraph homomorphismrole assignment

Mathematics Subject Classification ID

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

Related Items

Structural similarity: spectral methods for relaxed blockmodeling ⋮ Mixed hypergraphs and other coloring problems ⋮ A survey of the algorithmic aspects of modular decomposition ⋮ Complexity of Locally Injective Homomorphism to the Theta Graphs ⋮ Locally Injective Homomorphism to the Simple Weight Graphs ⋮ On the computational complexity of partial covers of theta graphs ⋮ Group-Level Analysis and Visualization of Social Networks