1. //
  2. Start
  3. //
  4. Publications
  5. Automatic enumeration of all connected s...
  6. Output formats
  7. //

Automatic enumeration of all connected subgraphs.

Research output: Journal contributions › Journal articles › Research › peer-review

Standard

Automatic enumeration of all connected subgraphs. / Rücker, Gerta; Rücker, Christoph.
In: MATCH Communications in mathematical and in computer chemistry, Vol. 41, 03.2000, p. 145-149.

Research output: Journal contributions › Journal articles › Research › peer-review

Harvard

Rücker, G & Rücker, C 2000, 'Automatic enumeration of all connected subgraphs.', MATCH Communications in mathematical and in computer chemistry, vol. 41, pp. 145-149. <http://match.pmf.kg.ac.rs/electronic_versions/Match41/match41_145-149.pdf>

APA

Rücker, G., & Rücker, C. (2000). Automatic enumeration of all connected subgraphs. MATCH Communications in mathematical and in computer chemistry, 41, 145-149. http://match.pmf.kg.ac.rs/electronic_versions/Match41/match41_145-149.pdf

Vancouver

Rücker G, Rücker C. Automatic enumeration of all connected subgraphs. MATCH Communications in mathematical and in computer chemistry. 2000 Mar;41:145-149.

Bibtex

@article{b766e46924d44e648ef43f00567d61bb,
title = "Automatic enumeration of all connected subgraphs.",
abstract = "A computer program for generating all connected subgraphs of a connected undirected simple graph is introduced, which is based on a path-tracing algorithm in the graph's edge adjacency matrix.",
keywords = "Mathematics",
author = "Gerta R{\"u}cker and Christoph R{\"u}cker",
year = "2000",
month = mar,
language = "English",
volume = "41",
pages = "145--149",
journal = "MATCH Communications in mathematical and in computer chemistry",
publisher = "University of Kragujevac, Faculty of Science",

}

RIS

TY - JOUR

T1 - Automatic enumeration of all connected subgraphs.

AU - Rücker, Gerta

AU - Rücker, Christoph

PY - 2000/3

Y1 - 2000/3

N2 - A computer program for generating all connected subgraphs of a connected undirected simple graph is introduced, which is based on a path-tracing algorithm in the graph's edge adjacency matrix.

AB - A computer program for generating all connected subgraphs of a connected undirected simple graph is introduced, which is based on a path-tracing algorithm in the graph's edge adjacency matrix.

KW - Mathematics

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

M3 - Journal articles

VL - 41

SP - 145

EP - 149

JO - MATCH Communications in mathematical and in computer chemistry

JF - MATCH Communications in mathematical and in computer chemistry

ER -

Related by journal

Algebraic combinatorics in mathematical chemistry. Methods and algorithms. I. Permutation groups and coherent (cellular) algebras.

Klin, M., Rücker, C., Rücker, G. & Tinhofer, G., 01.10.1999, In: MATCH Communications in mathematical and in computer chemistry. 40, p. 7-138 132 p.

Research output: Journal contributions › Journal articles › Research › peer-review

History and progress of the generation of structural formulae in chemistry and its applications.

Gugisch, R., Kerber, A., Laue, R., Meringer, M. & Rücker, C., 2007, In: MATCH Communications in mathematical and in computer chemistry. 58, 2, p. 239-280 42 p.

Research output: Journal contributions › Journal articles › Research › peer-review

How many organic compounds are graph-theoretically nonplanar?

Rücker, C. & Meringer, M., 03.2002, In: MATCH Communications in mathematical and in computer chemistry. 45, 45, p. 153-172 20 p.

Research output: Journal contributions › Journal articles › Research › peer-review

Molecules in silico: potential versus known organic compounds.

Kerber, A., Laue, R., Meringer, M. & Rücker, C., 2005, In: MATCH Communications in mathematical and in computer chemistry. 54, 2, p. 301-312 12 p.

Research output: Journal contributions › Journal articles › Research › peer-review

MOLGEN-QSPR, a software package for the study of quantitative structure-property relationships.

Kerber, A., Laue, R., Meringer, M. & Rücker, C., 04.2004, In: MATCH Communications in mathematical and in computer chemistry. 51, 51, p. 187-204 18 p.

Research output: Journal contributions › Journal articles › Research › peer-review

Other publications by the same author(s)

Are Si-C bonds cleaved by microorganisms? A critical review on biodegradation of methylsiloxanes

Rücker, C., Grabitz, E. & Kümmerer, K., 01.04.2023, In: Chemosphere. 321, 137858.

Research output: Journal contributions › Journal articles › Research › peer-review

Are Si–C bonds formed in the environment and/or in technical microbiological systems?

Rücker, C., Winkelmann, M. & Kümmerer, K., 08.2023, In: Environmental Science and Pollution Research. 30, 39, p. 91492-91500 9 p.

Research output: Journal contributions › Journal articles › Research › peer-review

REACH und QSAR: ein Leitfaden für kleine und mittlere Unternehmen

Rücker, C., Mahmoud, W. M. M., Kümmerer, K. & Zipperer, U. (Editor), 06.2015, Lüneburg: Leuphana Universität Lüneburg, 29 p.

Research output: Working paper › Project reports › Research

Comment on "nomenclature, Chemical Abstracts Service Numbers, Isomer Enumeration, Ring Strain, and Stereochemistry: What Does Any of This Have to Do with an International Chemical Disarmament and Nonproliferation Treaty?"

Rücker, C., Meringer, M. & Wassermann, A., 13.04.2021, In: Journal of Chemical Education. 98, 4, p. 1465-1467 3 p.

Research output: Journal contributions › Comments / Debate / Reports › Research

Octanol-Water Partition Coefficient Measurement by a Simple 1H NMR Method

Cumming, H. & Rücker, C., 30.09.2017, In: ACS Omega. 2, 9, p. 6244-6249 6 p.

Research output: Journal contributions › Journal articles › Research › peer-review

Links

Recently viewed

Activities

  1. Perfect anti-windup in output tracking scheme with preaction
  2. Do connectives improve the level of understandability in mathematical modeling tasks?
  3. Improving the quality of selecting applicants for university student programs
  4. A Learning Agent for Parameter Adaptation in Speeded Tests
  5. Presentation of the paper entitled "Comparison of Backpropagation and Kalman Filter-based Training for Neural Networks"
  6. Maximum-Likelihood-Based Panel Cointegration Testing
  7. Answering Boolean Hybrid Questions with HAWK
  8. How, when, and why do negotiators use reference points? A qualitative interview study with negotiation experts.
  9. The Domestication Approach Revisited in the Context of Digitization, Mobilization and Mediatization
  10. Preliminary selection of experimental techniques in Subtask D
  11. The Value Knowledge Grid - a new way of diagnosing the Culturally Non-Copyables: Building Blocks for Diagnostics
  12. Closing Session: Summary Notes
  13. International Conference on Methods and Models in Automation an Robotics - MMAR 2016
  14. Everything flows – identification and characterization of coherent patterns
  15. Teaching the machine how to assess grammar skills. Modelling verb-tense exercise characteristics as a basis for an adaptive E-learning system
  16. A Framework for Text Analytics in Online Interventions

Publications

  1. A Wavelet Packet Tree Denoising Algorithm for Images of Atomic-Force Microscopy
  2. A New Framework for Production Planning and Control to Support the Positioning in Fields of Tension Created by Opposing Logistic Objectives
  3. Introducing parametric uncertainty into a nonlinear friction model
  4. Volume of Imbalance Container Prediction using Kalman Filter and Long Short-Term Memory
  5. Age effects on controlling tools with sensorimotor transformations
  6. Using protochirons for three-dimensional coding of certain chemical structures.
  7. Second language learners' performance in mathematics
  8. A discrete approximate solution for the asymptotic tracking problem in affine nonlinear systems
  9. Improving students’ science text comprehension through metacognitive self-regulation when applying learning strategies
  10. A guided simulated annealing search for solving the pick-up and delivery problem with time windows and capacity constraints
  11. Text Comprehension as a Mediator in Solving Mathematical Reality-Based Tasks
  12. Analysis and Implementation of a Resistance Temperature Estimator Based on Bi-Polynomial Least Squares Method and Discrete Kalman Filter
  13. Fixed-term Contracts and Wages Revisited Using Linked Employer-Employee Data from Germany
  14. Partitioned beta diversity patterns of plants across sharp and distinct boundaries of quartz habitat islands
  15. 'SPREAD THE APP, NOT THE VIRUS’ – AN EXTENSIVE SEM-APPROACH TO UNDERSTAND PANDEMIC TRACING APP USAGE IN GERMANY
  16. Distributed robust Gaussian Process regression
  17. Passive Peak Voltage Sensor for Multiple Sending Coils Inductive Power Transmission System
  18. Combining linked data and statistical information retrieval
  19. Inversion of fuzzy neural networks for the reduction of noise in the control loop
  20. Simulation based comparison of safety-stock calculation methods
  21. Using Wikipedia for Cross-Language Named Entity Recognition
  22. Control versus Complexity
  23. Selecting and Adapting Methods for Analysis and Design in Value-Sensitive Digital Social Innovation Projects: Toward Design Principles
  24. Convolutional Neural Networks
  25. Integrating the underlying structure of stochasticity into community ecology
  26. Cognitive load and instructionally supported learning with provided and learner-generated visualizations
  27. Globally asymptotic output feedback tracking of robot manipulators with actuator constraints
  28. Constructions and Reconstructions. The Architectural Image between Rendering and Photography
  29. Is too much help an obstacle? Effects of interactivity and cognitive style on learning with dynamic versus non-dynamic visualizations with narrative explanations
  30. Soft Optimal Computing Methods to Identify Surface Roughness in Manufacturing Using a Monotonic Regressor
  31. A Review of the Application of Machine Learning and Data Mining Approaches in Continuum Materials Mechanics
  32. Analysis And Comparison Of Dispatching RuleBased Scheduling In Dual-Resource Constrained Shop-Floor Scenarios