scientific article; zbMATH DE number 7306903
From MaRDI portal
Publication:5149013
Authors: Robin Vandaele, Yvan Saeys, Tijl De Bie 
Publication date: 5 February 2021
Full work available at URL: https://jmlr.csail.mit.edu/papers/v21/19-1032.html
Title of this publication is not available (Why is that?)
Recommendations
- Nearly exact mining of frequent trees in large networks
- Efficient algorithms for finding minimum spanning forests of hierarchically defined graphs
- scientific article; zbMATH DE number 3980506
- The forest metrics of a graph and their properties
- Embedding a forest in a graph
- Probabilistic and exact frequent subtree mining in graphs beyond forests
- Decomposing a graph into forests
- Topological mappings between graphs, trees and generalized trees
visualizationmetric spacestopological data analysisgraph miningcluster coefficientcell trajectory inferencetopological skeletonization
Cites Work
- Title not available (Why is that?)
- Topology and data
- Title not available (Why is that?)
- Barcodes: The persistent topology of data
- Principal Curves
- Collective dynamics of `small-world' networks
- Title not available (Why is that?)
- Improved bound for complexity of matrix multiplication
- Topological pattern recognition for point cloud data
- A review of extensive facility location in networks
- Centrality measure in graphs
- A minimum spanning tree algorithm with inverse-Ackermann type complexity
- A branch-and-cut algorithm for the median-path problem
- The subgraph homeomorphism problem
- Optimal location of a path or tree on a network with cycles
- Location Of A Tree Shaped Facility In A Network
- A minimum length covering subgraph of a network
- A higher-dimensional homologically persistent skeleton
- Persistence theory. From quiver representations to data analysis
- Comparison of different generalizations of clustering coefficient and local efficiency for weighted undirected graphs
- The Ackermann function. a theoretical, computational, and formula manipulative study
Uses Software
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5149013)
