Automatic enumeration of all connected subgraphs.

Research output: Journal contributionsJournal articlesResearchpeer-review

Authors

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.

Translated title of the contributionAutomatische Aufzählung aller zusammenhängenden Subgraphen.
Original languageEnglish
JournalMATCH Communications in mathematical and in computer chemistry
Volume41
Pages (from-to)145-149
Number of pages5
Publication statusPublished - 03.2000
Externally publishedYes

Recently viewed

Publications

  1. The Use of Genetic Algorithm for PID Controller Auto-Tuning in ARM CORTEX M4 Platform
  2. Methodologies for Noise and Gross Error Detection using Univariate Signal-Based Approaches in Industrial Application
  3. Spatial mislocalization as a consequence of sequential coding of stimuli
  4. Comparing Two Voltage Observers in a Sensorsystem using Repetitive Control
  5. Binary Random Nets I
  6. Modeling Effective and Ineffective Knowledge Communication and Learning Discourses in CSCL with Hidden Markov Models
  7. Evolutionary generation of dispatching rule sets for complex dynamic scheduling problems
  8. Using complexity metrics with R-R intervals and BPM heart rate measures
  9. Algebraic combinatorics in mathematical chemistry. Methods and algorithms. I. Permutation groups and coherent (cellular) algebras.
  10. Authenticity and authentication in language learning
  11. Ant colony optimization algorithm and artificial immune system applied to a robot route
  12. Detection and mapping of water pollution variation in the Nile Delta using multivariate clustering and GIS techniques
  13. Knowledge Graph Question Answering Using Graph-Pattern Isomorphism
  14. Supervised clustering of streaming data for email batch detection
  15. Data-Generating Mechanisms Versus Constructively Defined Latent Variables in Multitrait–Multimethod Analysis:
  16. Multidimensional Cross-Recurrence Quantification Analysis (MdCRQA)–A Method for Quantifying Correlation between Multivariate Time-Series
  17. Modified dynamic programming approach for offline segmentation of long hydrometeorological time series
  18. Development of a Didactic Graphical Simulation Interface on MATLAB for Systems Control
  19. Graph Conditional Variational Models: Too Complex for Multiagent Trajectories?
  20. A geometric algorithm for the output functional controllability in general manipulation systems and mechanisms
  21. Random measurement and prediction errors limit the practical relevance of two velocity sensors to estimate the 1RM back squat
  22. Contributions of declarative and procedural memory to accuracy and automatization during second language practice
  23. Using learning protocols for knowledge acquisition and problem solving with individual and group incentives
  24. Analysis of Complexity Reduction in Kalman Filters Through Decoupling Control With Chattered Inputs in PMSM
  25. Towards a Dynamic Interpretation of Subjective and Objective Values
  26. Discourse Analyses in Chat-based CSCL with Learning Protocols
  27. Modeling precipitation kinetics for multi-phase and multi-component systems using particle size distributions via a moving grid technique
  28. Substructure, subgraph, and walk counts as measures of the complexity of graphs and molecules.
  29. Homogenization modeling of thin-layer-type microstructures
  30. A Quadrant Approach of Camera Calibration Method for Depth Estimation Using a Stereo Vision System
  31. Multidimensional recurrence quantification analysis (MdRQA) for the analysis of multidimensional time-series