ScholarLens Back to search
2005•Lecture notes in computer scienceRequires access

The isomorphism problem is polynomially solvable for certain graph languages

Manfred Schnitzler

Open publisher page 4 citations

Abstract

This record does not include an abstract. Use the full-text link above if available.

About this research paper

What this paper is about

An abstract is not available in the OpenAlex record for this paper.

Why it matters

OpenAlex reports 4 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Key concepts: Graph isomorphism, Mathematics, Discrete mathematics, Graph property, Graph, Combinatorics, Graph automorphism, Voltage graph

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
The isomorphism problem is polynomially solvable for certain graph languages — Research Paper | ScholarLens