scientific article

From MaRDI portal

Revision as of 03:00, 6 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4037408

Jump to:navigation, search

zbMath0764.68064MaRDI QIDQ4037408

No author found.

Publication date: 18 May 1993

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

zbMATH Keywords

parallel algorithm linear arrangement minimal sumcut sequential linear algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Graph theory (including graph drawing) in computer science (68R10)

Related Items (7)

Vertex ordering and partitioning problems for random spatial graphs. ⋮ Algorithms and Bounds for L-Drawings of Directed Graphs ⋮ Memory management optimization problems for integrated circuit simulators ⋮ Graph layout problems ⋮ Fixed-parameter complexity of minimum profile problems ⋮ On the interval completion of chordal graphs ⋮ An experimental comparison of Variable Neighborhood Search variants for the minimization of the vertex-cut in layout problems

This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4037408&oldid=17755294"