2012•Radio Electronics Computer Science ControlOpen access

GRAPH-SUBGRAPH ISOMORPHISM PROBLEM SOLVING FOR DESIGNING SPECIAL COMPUTERS

Matviy Ilyashenko, A.A. Goldobin

Abstract

Гофман Е. А., Олейник А. А., Субботин С. А. СОКРАЩЕНИЕ БАЗ ЛИНГВИСТИЧЕСКИХ ПРАВИЛ НА ОСНОВЕ ДЕРЕВЬЕВ РЕШЕНИЙ Рассмотрена задача индукции лингвистических правил.Раз

Open-access reader

About this research paper

What this paper is about

Why it matters

A significance statement is not available in the OpenAlex record.

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.

Available abstract

Key concepts: Subgraph isomorphism problem, Induced subgraph isomorphism problem, Graph isomorphism, Isomorphism (crystallography), Computer science, Graph homomorphism, Theoretical computer science, Graph