Flow Complexity: Fast Polytopal Graph Complexity and 3D Object Clustering

DOI10.1007/978-3-642-02124-4_26zbMATH Open1248.68433OpenAlexW1597397461WikidataQ60431125 ScholiaQ60431125MaRDI QIDQ3637705FDOQ3637705

Authors: F. Escolano, Daniela Giorgi, Edwin R. Hancock, Miguel A. Lozano, Bianca Falcidieno 

Publication date: 14 July 2009

Published in: Graph-Based Representations in Pattern Recognition (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02124-4_26

Recommendations

• Data complexity measured by principal graphs
• Recursive geometry of the flow complex and topology of the flow complex filtration
• Depth-based complexity traces of graphs
• A parallel algorithm for computing the flow complex
• Reeb graphs for shape analysis and applications

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10) Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• A Riemannian approach to graph embedding
• Title not available (Why is that?)
• Spectral embedding of graphs.
• Protein classification by matching and clustering surface graphs
• Graph simplification and matching using commute times

This page was built for publication: Flow Complexity: Fast Polytopal Graph Complexity and 3D Object Clustering

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3637705)