Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

scientific article

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

zbMath0981.68119MaRDI QIDQ2748499

Lenwood S. Heath, Arnold L. Rosenberg

Publication date: 15 October 2001


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

graph separatorVLSI-circuits


Mathematics Subject Classification ID

Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10) Research exposition (monographs, survey articles) pertaining to computer science (68-02)


Related Items (8)

Minimal congestion trees ⋮ An experimental evaluation of local search heuristics for graph partitioning ⋮ New constructions of SSPDs and their applications ⋮ The size and depth of layered Boolean circuits ⋮ \(N\)-separators in planar graphs ⋮ Solution methods for the vertex variant of the network system vulnerability analysis problem ⋮ Embedding multidimensional grids into optimal hypercubes ⋮ Separator-based graph embedding into multidimensional grids with small edge-congestion







This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2748499&oldid=15622787"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 3 February 2024, at 14:23.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki