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

scientific article; zbMATH DE number 741209

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

zbMATH Open0830.68097MaRDI QIDQ4327554FDOQ4327554


Authors: Tony F. Chan, W. K. Szeto Edit this on Wikidata


Publication date: 9 April 1995



Title of this publication is not available (Why is that?)



Recommendations

  • On the Optimality of the Median Cut Spectral Bisection Graph Partitioning Method
  • How Good is Recursive Bisection?
  • Computational Science - ICCS 2004
  • Spectral bisection with two eigenvectors
  • Improvements on spectral bisection


zbMATH Keywords

minimum cut graph partitionrecursive spectral bisection


Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)



Cited In (1)

  • Computational Science - ICCS 2004





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 Q4327554)

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