scientific article; zbMATH DE number 7306903
From MaRDI portal
Publication:5149013
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
Cites work
- scientific article; zbMATH DE number 3579840 (Why is no real title available?)
- scientific article; zbMATH DE number 2080487 (Why is no real title available?)
- scientific article; zbMATH DE number 2103273 (Why is no real title available?)
- A branch-and-cut algorithm for the median-path problem
- A higher-dimensional homologically persistent skeleton
- A minimum length covering subgraph of a network
- A minimum spanning tree algorithm with inverse-Ackermann type complexity
- A review of extensive facility location in networks
- Barcodes: The persistent topology of data
- Centrality measure in graphs
- Collective dynamics of `small-world' networks
- Comparison of different generalizations of clustering coefficient and local efficiency for weighted undirected graphs
- Improved bound for complexity of matrix multiplication
- Location Of A Tree Shaped Facility In A Network
- Optimal location of a path or tree on a network with cycles
- Persistence theory. From quiver representations to data analysis
- Principal Curves
- The Ackermann function. a theoretical, computational, and formula manipulative study
- The subgraph homeomorphism problem
- Topological pattern recognition for point cloud data
- Topology and data
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)
