Frank Emmert-Streib

From MaRDI portal
Revision as of 12:52, 10 December 2023 by AuthorDisambiguator (talk | contribs) (AuthorDisambiguator moved page Frank Emmert-Streib to Frank Emmert-Streib: Duplicate)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:279579

Available identifiers

zbMath Open emmert-streib.frankDBLP99/3214WikidataQ55079196 ScholiaQ55079196MaRDI QIDQ279579

List of research outcomes





PublicationDate of PublicationType
Relationships between symmetry-based graph measures2024-01-19Paper
On the relationship between PageRank and automorphisms of a graph2024-01-10Paper
Mathematical foundations of data science using R2022-10-24Paper
Szeged-like entropies of graphs2022-07-11Paper
On the zeros of the partial Hosoya polynomial of graphs2021-04-19Paper
On graph entropy measures based on the number of independent sets and matchings2021-03-31Paper
On the degeneracy of the Randić entropy and related graph measures2021-02-04Paper
Hermitian normalized Laplacian matrix for directed networks2020-12-10Paper
Graph measures with high discrimination power revisited: a random polynomial approach2020-09-22Paper
Towards detecting structural branching and cyclicity in graphs: a polynomial-based approach2020-09-22Paper
Quantitative graph theory: a new branch of graph theory and network science2020-07-16Paper
Relations and bounds for the zeros of graph polynomials using vertex orbits2020-05-14Paper
The watching system as a generalization of identifying code2020-05-14Paper
A note on distance-based entropy of dendrimers2020-03-24Paper
A graph theoretic approach to construct desired cryptographic Boolean functions2020-03-23Paper
Mathematical foundations of data science using R2020-03-11Paper
Properties of graph distance measures by means of discrete inequalities2020-02-17Paper
Highly unique network descriptors based on the roots of the permanental polynomial2020-02-07Paper
On efficient network similarity measures2020-01-09Paper
Graph entropy based on the number of spanning forests of \(c\)-cyclic graphs2020-01-09Paper
Hosoya entropy of fullerene graphs2019-11-27Paper
Graph distance measures based on topological indices revisited2019-03-15Paper
Fifty years of graph matching, network alignment and network comparison2018-10-30Paper
Comments to “Quantification of network structural dissimilarities” published by Schieber et al2018-10-09Paper
Probabilistic inequalities for evaluating structural network measures2017-02-08Paper
https://portal.mardi4nfdi.de/entity/Q28341452016-11-25Paper
Entropy of weighted graphs with Randić weights2016-06-15Paper
Entropy bounds for dendrimers2016-04-28Paper
A computational approach to construct a multivariate complete graph invariant2016-01-14Paper
Quantitative Graph Theory2014-10-06Paper
Universal construction mechanism for networks from one-dimensional symbol sequences2014-05-07Paper
An efficient heuristic approach to detecting graph isomorphism based on combinations of highly discriminating invariants2013-08-27Paper
Evolutionary dynamics of the spatial prisoner's dilemma with self-inhibition2012-05-18Paper
A Brief Introduction to Complex Networks and Their Analysis2010-12-21Paper
Structural similarity of directed universal hierarchical graphs: a low computational complexity approach2010-09-01Paper
ROBUSTNESS IN SCALE-FREE NETWORKS: COMPARING DIRECTED AND UNDIRECTED NETWORKS2008-12-01Paper
NONLINEAR TIME SERIES PREDICTION BASED ON A POWER-LAW NOISE MODEL2008-11-03Paper
Structural information content of networks: graph entropy based on local vertex functionals2008-08-12Paper
A comparative analysis of multidimensional features of objects resembling sets of graphs2008-03-06Paper
Information theoretic measures of UHG graphs with low computational complexity2007-09-19Paper
Comparing large graphs efficiently by margins of feature vectors2007-07-10Paper
Topological mappings between graphs, trees and generalized trees2007-06-06Paper
A HETEROSYNAPTIC LEARNING RULE FOR NEURAL NETWORKS2007-03-20Paper
A similarity measure for graphs with low computational complexity2007-01-09Paper
STOCHASTIC SZNAJD MODEL IN OPEN COMMUNITY2006-01-31Paper

Research outcomes over time

This page was built for person: Frank Emmert-Streib