scientific article

From MaRDI portal

Revision as of 13:20, 4 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

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

Publication:3326858

Jump to:navigation, search

zbMath0539.68059MaRDI QIDQ3326858

F. S. Makedon, Christos H. Papadimitriou, Ivan Hal Sudborough

Publication date: 1983

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

zbMATH Keywords

bandwidth NP-complete topological bandwidth linear layout modified cutwidth node search number degree three graphs degree three trees having Min Cut Linear Arrangement problem recursive characterization

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (2)

Well quasi orders in subclasses of bounded treewidth graphs and their algorithmic applications ⋮ Searching and pebbling

This page was built for publication:

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