The following pages link to Frank Emmert-Streib (Q279579):
Displaying 48 items.
- Entropy bounds for dendrimers (Q279580) (← links)
- Entropy of weighted graphs with Randić weights (Q296334) (← links)
- (Q360468) (redirect page) (← links)
- An efficient heuristic approach to detecting graph isomorphism based on combinations of highly discriminating invariants (Q360469) (← links)
- (Q422895) (redirect page) (← links)
- Evolutionary dynamics of the spatial prisoner's dilemma with self-inhibition (Q422896) (← links)
- (Q508735) (redirect page) (← links)
- Probabilistic inequalities for evaluating structural network measures (Q508736) (← links)
- Graph distance measures based on topological indices revisited (Q669403) (← links)
- Quantitative graph theory: a new branch of graph theory and network science (Q780939) (← links)
- A similarity measure for graphs with low computational complexity (Q861127) (← links)
- Topological mappings between graphs, trees and generalized trees (Q884588) (← links)
- A computational approach to construct a multivariate complete graph invariant (Q903598) (← links)
- Structural information content of networks: graph entropy based on local vertex functionals (Q936078) (← links)
- Structural similarity of directed universal hierarchical graphs: a low computational complexity approach (Q990638) (← links)
- Fifty years of graph matching, network alignment and network comparison (Q1991876) (← links)
- Hosoya entropy of fullerene graphs (Q2010674) (← links)
- Szeged-like entropies of graphs (Q2152724) (← links)
- Relations and bounds for the zeros of graph polynomials using vertex orbits (Q2180690) (← links)
- The watching system as a generalization of identifying code (Q2180726) (← links)
- Graph measures with high discrimination power revisited: a random polynomial approach (Q2200600) (← links)
- Towards detecting structural branching and cyclicity in graphs: a polynomial-based approach (Q2200659) (← links)
- Hermitian normalized Laplacian matrix for directed networks (Q2215051) (← links)
- On the degeneracy of the Randić entropy and related graph measures (Q2224838) (← links)
- On efficient network similarity measures (Q2286037) (← links)
- Graph entropy based on the number of spanning forests of \(c\)-cyclic graphs (Q2286143) (← links)
- Highly unique network descriptors based on the roots of the permanental polynomial (Q2293292) (← links)
- Properties of graph distance measures by means of discrete inequalities (Q2295900) (← links)
- A graph theoretic approach to construct desired cryptographic Boolean functions (Q2306306) (← links)
- A note on distance-based entropy of dendrimers (Q2306633) (← links)
- Comparing large graphs efficiently by margins of feature vectors (Q2372051) (← links)
- Information theoretic measures of UHG graphs with low computational complexity (Q2383930) (← links)
- Universal construction mechanism for networks from one-dimensional symbol sequences (Q2449208) (← links)
- A comparative analysis of multidimensional features of objects resembling sets of graphs (Q2474878) (← links)
- On graph entropy measures based on the number of independent sets and matchings (Q2660906) (← links)
- On the zeros of the partial Hosoya polynomial of graphs (Q2663563) (← links)
- Influence of statistical estimators on the large-scale causal inference of regulatory networks (Q2834145) (← links)
- A Brief Introduction to Complex Networks and Their Analysis (Q3064393) (← links)
- Quantitative Graph Theory (Q3191626) (← links)
- STOCHASTIC SZNAJD MODEL IN OPEN COMMUNITY (Q3368599) (← links)
- A HETEROSYNAPTIC LEARNING RULE FOR NEURAL NETWORKS (Q3430069) (← links)
- NONLINEAR TIME SERIES PREDICTION BASED ON A POWER-LAW NOISE MODEL (Q3532382) (← links)
- ROBUSTNESS IN SCALE-FREE NETWORKS: COMPARING DIRECTED AND UNDIRECTED NETWORKS (Q3542829) (← links)
- Comments to “Quantification of network structural dissimilarities” published by Schieber et al (Q4685560) (← links)
- Mathematical foundations of data science using R (Q5918542) (← links)
- Mathematical foundations of data science using R (Q5919493) (← links)
- Relationships between symmetry-based graph measures (Q6139463) (← links)
- On the relationship between PageRank and automorphisms of a graph (Q6186845) (← links)
