scientific article; zbMATH DE number 3854443

MaRDI QIDQ3323291zbMATH OpenFDO

Authors O. Vornberger

Publication date 1982

zbMATH Keywords

graph-separationindirected graphsmulti processor schedulingNP-completenumbering of the verticespolynomial time

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Deterministic scheduling theory in operations research (90B35)

Recommendations

• On Some Variants of the Bandwidth Minimization Problem
• On the separation number of a graph
• scientific article; zbMATH DE number 638688
• The vertex separation number of a graph equals its path-width
• NP-completeness of the Planar Separator Problems

Cited in

(8)

• Scheduling real-time computations with separation constraints
• Separation problems and forcing
• On Some Variants of the Bandwidth Minimization Problem
• scientific article; zbMATH DE number 3911262 (Why is no real title available?)
• scientific article; zbMATH DE number 1193306 (Why is no real title available?)
• The total vertex separation number of a graph
• Separating Without Any Ambiguity.
• Separation numbers of trees

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