Depth-based complexity traces of graphs
type: Item
instance of: scholarly article
title: Depth-based complexity traces of graphs
zbMATH Open document ID: 1326.68241
author: Lu Bai
author: Edwin R. Hancock
published in: Pattern Recognition
publication date: 2015-12-08T00:00:00Z
Mathematics Subject Classification ID: 68T10
Mathematics Subject Classification ID: 05C81
Mathematics Subject Classification ID: 05C90
Mathematics Subject Classification ID: 62H25
Mathematics Subject Classification ID: 94A17
zbMATH DE Number: 6517987
zbMATH Keywords: depth-based complexity traces
zbMATH Keywords: entropy
zbMATH Keywords: entropy difference
zbMATH Keywords: centroid vertex
zbMATH Keywords: centroid expansion subgraphs
zbMATH Keywords: graph classification
Wikidata QID: Q60430863
describes a project that uses: COIL-20
describes a project that uses: AFGen
MaRDI profile type: Publication
full work available at URL: j.patcog.2013.09.010
OpenAlex ID: W1976159745
cites work: Q3093242
cites work: Q3214803
cites work: Entropy and the complexity of graphs revisited
cites work: Q5485943
cites work: Graph complexity
cites work: Measures of statistical complexity: why?
cites work: A history of graph entropy measures
cites work: The Laplacian of a graph as a density matrix: a basic combinatorial approach to separability of mixed states
cites work: Chromatic number and the 2-rank of a graph
cites work: Information processing in complex networks: Graph entropy and information functionals
cites work: Centers to centroids in graphs
cites work: Center of a graph with respect to edges
cites work: Q3922726
cites work: Learning Theory and Kernel Machines
cites work: Mining Graph Data
cites work: Network analysis. Methodological foundations.
cites work: Entropy and the complexity of graphs: I. An index of the relative complexity of a graph
cites work: Efficient Algorithms for Shortest Paths in Sparse Networks
cites work: Graph kernels from the Jensen-Shannon divergence
cites work: Bridging the Gap between Graph Edit Distance and Kernel Machines
cites work: A Quantum Jensen-Shannon Graph Kernel Using the Continuous-Time Quantum Walk
cites work: Nonextensive information theoretic kernels on measures
DBLP publication ID: journals/pr/BaiH14
DOI: 10.1016/J.PATCOG.2013.09.010
description: scientific article; zbMATH DE number 6517987