Depth-based complexity traces of graphs
DOI10.1016/J.PATCOG.2013.09.010zbMATH Open1326.68241DBLPjournals/pr/BaiH14OpenAlexW1976159745WikidataQ60430863 ScholiaQ60430863MaRDI QIDQ898379FDOQ898379
Authors: Lu Bai, Edwin R. Hancock 
Publication date: 8 December 2015
Published in: Pattern Recognition (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.patcog.2013.09.010
Recommendations
- Depth-based hypergraph complexity traces from directed line graphs
- Fast depth-based subgraph kernels for unattributed graphs
- Entropy and the complexity of graphs revisited
- Structural information content of networks: graph entropy based on local vertex functionals
- An axiomatic approach to network complexity
entropygraph classificationcentroid expansion subgraphscentroid vertexdepth-based complexity tracesentropy difference
Factor analysis and principal components; correspondence analysis (62H25) Applications of graph theory (05C90) Pattern recognition, speech recognition (68T10) Measures of information, entropy (94A17) Random walks on graphs (05C81)
Cites Work
- Title not available (Why is that?)
- Chromatic number and the 2-rank of a graph
- Efficient Algorithms for Shortest Paths in Sparse Networks
- The Laplacian of a graph as a density matrix: a basic combinatorial approach to separability of mixed states
- A history of graph entropy measures
- Information processing in complex networks: Graph entropy and information functionals
- Measures of statistical complexity: why?
- Entropy and the complexity of graphs: I. An index of the relative complexity of a graph
- Network analysis. Methodological foundations.
- Mining Graph Data
- On graph kernels: hardness results and efficient alternatives.
- Bridging the Gap between Graph Edit Distance and Kernel Machines
- Diffusion kernels on statistical manifolds
- Graph complexity
- Complexity in chemistry, biology and ecology.
- Centers to centroids in graphs
- Nonextensive information theoretic kernels on measures
- Graph kernels from the Jensen-Shannon divergence
- Entropy and the complexity of graphs revisited
- Center of a graph with respect to edges
- Title not available (Why is that?)
- A quantum Jensen-Shannon graph kernel using the continuous-time quantum walk
Cited In (9)
- Graph characterization by counting sink star subgraphs
- Flow Complexity: Fast Polytopal Graph Complexity and 3D Object Clustering
- Depth-based hypergraph complexity traces from directed line graphs
- A nested alignment graph kernel through the dynamic time warping framework
- Minimising entropy changes in dynamic network evolution
- Branch-depth: generalizing tree-depth of graphs
- Fast depth-based subgraph kernels for unattributed graphs
- Estimation of expressions' complexities for two-terminal directed acyclic graphs
- Title not available (Why is that?)
Uses Software
This page was built for publication: Depth-based complexity traces of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q898379)
