Travelled to:
1 × Germany
Collaborated with:
∅
Talks about:
polynomi (1) isomorph (1) solvabl (1) problem (1) languag (1) certain (1) graph (1)
Person: Manfred Schnitzler
DBLP: Schnitzler:Manfred
Contributed to:
Wrote 1 papers:
- GG-1982-Schnitzler #graph #morphism #problem
- The isomorphism problem is polynomially solvable for certain graph languages (MS), pp. 369–379.