On using the adjacency matrix power method for perception of symmetry and for isomorphism testing of highly intricate graphs.

Publikation: Beiträge in ZeitschriftenZeitschriftenaufsätzeForschungbegutachtet

Standard

On using the adjacency matrix power method for perception of symmetry and for isomorphism testing of highly intricate graphs. / Rücker, Christoph; Rücker, Gerta.
in: Journal of Chemical Information and Computer Science, Jahrgang 31, Nr. 1, 01.02.1991, S. 123-126.

Publikation: Beiträge in ZeitschriftenZeitschriftenaufsätzeForschungbegutachtet

Harvard

APA

Vancouver

Bibtex

@article{c4a19b331ab94182942ba6d96e0a6b45,
title = "On using the adjacency matrix power method for perception of symmetry and for isomorphism testing of highly intricate graphs.",
abstract = "A modification of the adjacency matrix power method described recently for the perception of symmetry in graphs is introduced, which expands the limits of the method far beyond the realm of chemically interesting graphs. The procedure finds the automorphism partition even for intricate graphs without performing a tree search. The calculation effort increases with the problem size polynomially for all tested cases, including strongly regular graphs, two-level regular graphs, and graphs corresponding to balanced incomplete block designs (BIBD). An equally powerful computer program for testing isomorphism of graphs based on the adjacency matrix power method is introduced.",
keywords = "Chemistry",
author = "Christoph R{\"u}cker and Gerta R{\"u}cker",
year = "1991",
month = feb,
day = "1",
doi = "10.1021/ci00001a022",
language = "English",
volume = "31",
pages = "123--126",
journal = "Journal of Chemical Information and Computer Science",
issn = "1520-5142",
publisher = "American Chemical Society",
number = "1",

}

RIS

TY - JOUR

T1 - On using the adjacency matrix power method for perception of symmetry and for isomorphism testing of highly intricate graphs.

AU - Rücker, Christoph

AU - Rücker, Gerta

PY - 1991/2/1

Y1 - 1991/2/1

N2 - A modification of the adjacency matrix power method described recently for the perception of symmetry in graphs is introduced, which expands the limits of the method far beyond the realm of chemically interesting graphs. The procedure finds the automorphism partition even for intricate graphs without performing a tree search. The calculation effort increases with the problem size polynomially for all tested cases, including strongly regular graphs, two-level regular graphs, and graphs corresponding to balanced incomplete block designs (BIBD). An equally powerful computer program for testing isomorphism of graphs based on the adjacency matrix power method is introduced.

AB - A modification of the adjacency matrix power method described recently for the perception of symmetry in graphs is introduced, which expands the limits of the method far beyond the realm of chemically interesting graphs. The procedure finds the automorphism partition even for intricate graphs without performing a tree search. The calculation effort increases with the problem size polynomially for all tested cases, including strongly regular graphs, two-level regular graphs, and graphs corresponding to balanced incomplete block designs (BIBD). An equally powerful computer program for testing isomorphism of graphs based on the adjacency matrix power method is introduced.

KW - Chemistry

UR - http://www.scopus.com/inward/record.url?scp=0026112345&partnerID=8YFLogxK

UR - https://www.mendeley.com/catalogue/545c7a09-d621-3364-84a7-03c1323a90f3/

U2 - 10.1021/ci00001a022

DO - 10.1021/ci00001a022

M3 - Journal articles

VL - 31

SP - 123

EP - 126

JO - Journal of Chemical Information and Computer Science

JF - Journal of Chemical Information and Computer Science

SN - 1520-5142

IS - 1

ER -

DOI

Zuletzt angesehen

Publikationen

  1. Joint entity and relation linking using EARL
  2. Learning Rotation Sensitive Neural Network for Deformed Objects' Detection in Fisheye Images
  3. Dynamic adjustment of dispatching rule parameters in flow shops with sequence-dependent set-up times
  4. Evaluating the construct validity of Objective Personality Tests using a multitrait-multimethod-Multioccasion-(MTMM-MO)-approach
  5. Analyzing different types of moderated method effects in confirmatory factor models for structurally different methods
  6. A coding scheme to analyse global text processing in computer supported collaborative learning: What eye movements can tell us
  7. Binary Random Nets I
  8. Using Natural Language Processing Techniques to Tackle the Construct Identity Problem in Information Systems Research
  9. Ant colony optimization algorithm and artificial immune system applied to a robot route
  10. Development of a Didactic Graphical Simulation Interface on MATLAB for Systems Control
  11. Graph Conditional Variational Models: Too Complex for Multiagent Trajectories?
  12. Analysis of Complexity Reduction in Kalman Filters Through Decoupling Control With Chattered Inputs in PMSM
  13. Towards a Dynamic Interpretation of Subjective and Objective Values
  14. Using protochirons for three-dimensional coding of certain chemical structures.
  15. Adaptive and Dynamic Feedback Loops between Production System and Production Network based on the Asset Administration Shell
  16. Predicting the Difficulty of Exercise Items for Dynamic Difficulty Adaptation in Adaptive Language Tutoring
  17. The Scalable Question Answering Over Linked Data (SQA) Challenge 2018
  18. A Lightweight Simulation Model for Soft Robot's Locomotion and its Application to Trajectory Optimization
  19. Application of non-convex rate dependent gradient plasticity to the modeling and simulation of inelastic microstructure development and inhomogeneous material behavior
  20. Isocodal and isospectral points, edges, and pairs in graphs and how to cope with them in computerized symmetry recognition
  21. On the Power and Performance of a Doubly Latent Residual Approach to Explain Latent Specific Factors in Multilevel-Bifactor-(S-1) Models
  22. Building a process layer for business applications using the blackboard pattern
  23. A discrete approximate solution for the asymptotic tracking problem in affine nonlinear systems
  24. Global text processing in CSCL with learning protocols
  25. Performance and Comfort when Using Motion-Controlled Tools in Complex Tasks
  26. Neural network-based adaptive fault-tolerant control for strict-feedback nonlinear systems with input dead zone and saturation
  27. N3 - A collection of datasets for named entity recognition and disambiguation in the NLP interchange format
  28. Comparing the Sensitivity of Social Networks, Web Graphs, and Random Graphs with Respect to Vertex Removal
  29. Optimal trajectory generation using MPC in robotino and its implementation with ROS system
  30. Multi-Parallel Sending Coils for Movable Receivers in Inductive Charging Systems
  31. On the Nonlinearity Compensation in Permanent Magnet Machine Using a Controller Based on a Controlled Invariant Subspace
  32. Paraphrasing Method for Controlling a Robotic Arm Using a Large Language Model
  33. Anomaly detection in formed sheet metals using convolutional autoencoders
  34. A Multilevel CFA-MTMM Model for Nested Structurally Different Methods
  35. Selection and Recognition of Statistically Defined Signals in Learning Systems
  36. Linux-based Embedded System for Wavelet Denoising and Monitoring of sEMG Signals using an Axiomatic Seminorm