Graph potentials method and its application for chemical information processing

A graph potentials method for the solution of isomorphism and automorpism partitioning problems is proposed. The method is based on an analogy between graphs and electrical networks and serves to compute graph invariants, including vertex potentials and other characteristics and to provide an effici...

Full description

Saved in:
Bibliographic Details
Published inJournal of chemical information and computer sciences Vol. 21; no. 4; pp. 196 - 204
Main Authors Golender, V. E, Drboglav, V. V, Rosenblit, A. B
Format Journal Article
LanguageEnglish
Published American Chemical Society 01.11.1981
Subjects
Chemical structures
Chemistry
Computerised information retrieval
Computerized information storage and retrieval
Computerized subject indexing
Graphs
Information storage and retrieval
Information work
Organic chemistry
Searching
Structures
Subject indexing
Technical services
Online AccessGet full text

Cover

More Information
Summary:A graph potentials method for the solution of isomorphism and automorpism partitioning problems is proposed. The method is based on an analogy between graphs and electrical networks and serves to compute graph invariants, including vertex potentials and other characteristics and to provide an efficient solution to the problems. Some computational results demonstrating sensitivity of the proposed method are presented.
Bibliography:istex:3EBDE0E63C0A979144C6549F81DD71444E074AAD
ark:/67375/TPS-28QB29KR-6
ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:0095-2338
1520-5142
DOI:10.1021/ci00032a004