Graph-Based Representations in Pattern Recognition
From MaRDI portal
Publication:5316486
DOI10.1007/B107037zbMATH Open1119.68498OpenAlexW4255834217MaRDI QIDQ5316486FDOQ5316486
Authors: Huaijun Qiu, Edwin R. Hancock
Publication date: 13 September 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b107037
Recommendations
- Comparison of algorithms in graph partitioning
- Constrained graph partitioning via matrix differential equations
- Constructive Heuristics and Lower Bounds for Graph Partitioning Based on a Principal-Components Approximation
- Spectra and optimal partitions of weighted graphs
- Abusing a hypergraph partitioner for unweighted graph partitioning
Pattern recognition, speech recognition (68T10) Graph theory (including graph drawing) in computer science (68R10) Machine vision and scene understanding (68T45)
Cited In (1)
This page was built for publication: Graph-Based Representations in Pattern Recognition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5316486)