Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

Graph-Based Representations in Pattern Recognition

From MaRDI portal
Publication:5316486
Jump to:navigation, search

DOI10.1007/B107037zbMATH Open1119.68498OpenAlexW4255834217MaRDI QIDQ5316486FDOQ5316486


Authors: Huaijun Qiu, Edwin R. Hancock Edit this on Wikidata


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


Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Graph theory (including graph drawing) in computer science (68R10) Machine vision and scene understanding (68T45)



Cited In (1)

  • A new graph representation for cable-membrane structures





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)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5316486&oldid=19993505"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 8 February 2024, at 22:30. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki