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

DOI10.1007/978-3-642-02124-4_26zbMath1248.68433OpenAlexW1597397461WikidataQ60431125 ScholiaQ60431125MaRDI QIDQ3637705

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

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

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• A Riemannian approach to graph embedding
• 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