39 citations · 70 across the 10 of their papers we have counts for
10 papers
Characterizing Planar Graphs
Vladimir Gudkov, Shmuel Nussinov, Zohar Nussinov
Cataloging planar diagrams using the depth concept is proposed.
Community Detection in Complex Networks by Dynamical Simplex Evolution
V. Gudkov, V. Montealegre
We benchmark the dynamical simplex evolution (DSE) method with several of the currently available algorithms to detect communities in complex networks by comparing the fraction of…
Generalized entropies and open random and scale-free networks
V. Gudkov, V. Montealegre
We propose the concept of open network as an arbitrary selection of nodes of a large unknown network. Using the hypothesis that information of the whole network structure can be ex…
Analysis of network by generalized mutual entropies
V. Gudkov, V. Montealegre
Generalized mutual entropy is defined for networks and applied for analysis of complex network structures. The method is tested for the case of computer simulated scale free networ…
A Novel Approach Applied to the Largest Clique Problem
Vladimir Gudkov, Shmuel Nussinov, Zohar Nussinov
A novel approach to complex problems has been previously applied to graph classification and the graph equivalence problem. Here we apply it to the NP complete problem of finding t…
Graph equivalence and characterization via a continuous evolution of a physical analog
Vladimir Gudkov, Shmuel Nussinov
A general novel approach mapping discrete, combinatorial, graph-theoretic problems onto ``physical'' models - namely simplexes in dimensions - is applied to the graph equ…