Results 181 to 190 of about 2,482 (203)

On perturbation theory and an algorithm for maximal clique enumeration in uncertain and noisy graphs

Proceedings of the 1st ACM SIGKDD Workshop on Knowledge Discovery from Uncertain Data, 2009
The maximal clique enumeration (MCE) problem can be used to find very tightly-coupled collections of objects inside a network or graph of relationships. However, when such networks are based on noisy or uncertain data, the solutions to the MCE problem for several closely related graphs may be necessary to accurately define the collections.Thus, we ...
William Hendrix, Matthew C. Schmidt, Paul Breimyer, Nagiza F. Samatova   +3 more
openaire   +1 more source

Enumeration and Classification of Anomaly/Peak Bases in Two-Dimensional Intensity Histograms. Application of Graph Theory to Crystallographic Data Imaging

Journal of Applied Crystallography, 1996
Bragg-event peaks, spikes, intensity streaks and other anomalies generate abnormal regions in two-dimensional intensity histograms from area-detector images. Examination of the shapes of these regions can contribute to the identification of the types of phenomena that generated them.
openaire   +1 more source

On Some Enumeration Problems in Graph Theory

1980
In this paper the following enumeration problems in Graph Theory are solved: (a) enumeration of simple border maps (b) enumeration of inequivalent 3-connected Hamiltonian rooted maps (c) enumeration of certain rooted triangular maps (d) enumeration of rooted 3-connected bicubic ...
openaire   +1 more source

Unveiling Order in Chaos: A Systematic Approach Based on Graph Theory in Enumerating Sudoku Grids of Rank n

Theory of Computing Systems
Pallavi Mishra, Rachna Bhatia, Predrag S. Stanimirović, D. K. Gupta, Rakesh P. Badoni   +4 more
openaire   +1 more source

On fast enumeration of maximal cliques in large graphs

Expert Systems With Applications, 2022
Kun He, Yangming Zhou, Yi Zhou
exaly  

Enumeration of Maximal Cliques from an Uncertain Graph

IEEE Transactions on Knowledge and Data Engineering, 2017
Arko Provo Mukherjee`, Srikanta Tirthapura   +1 more
exaly  

Enumeration of displacement graphs of epicyclic gear train from a given rotation graph using concept of building of kinematic units

Mechanism and Machine Theory, 2019
Srinivasa Prakash Regalla
exaly  

Shared-memory Parallel Maximal Clique Enumeration from Static and Dynamic Graphs

ACM Transactions on Parallel Computing, 2020
Apurba Das, Srikanta Tirthapura
exaly  

Enumeration of Regular Graph Coverings Having Finite Abelian Covering Transformation Groups

SIAM Journal on Discrete Mathematics, 1998
Jin Ho Kwak
exaly  

Parallelizing maximal clique and k-plex enumeration over graph data

Journal of Parallel and Distributed Computing, 2017
Zhuo Wang, Qun Chen, Boyi Hou
exaly