scientific article; zbMATH DE number 3974992

MaRDI QIDQ3741647zbMATH OpenFDO

Authors Dieter Kratsch

Publication date 1986

zbMATH Keywords

Bandwidth Minimization problemcomplexityInterval graphslinear layoutpolynomial algorithms

Mathematics Subject Classification ID

Graph theory (05C99) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Finding the minimum bandwidth of an interval graph
• Computing the Bandwidth of Interval Graphs
• scientific article; zbMATH DE number 4075107
• On finding the minimum bandwidth of interval graphs
• Bandwidth of Bipartite Permutation Graphs

Cited in

(12)

• Finding the minimum bandwidth of an interval graph
• On finding the minimum bandwidth of interval graphs
• Interval degree and bandwidth of a graph
• On a complementary interval graph with the lowest max-degree
• Profile minimization on products of graphs
• Computing the Bandwidth of Interval Graphs
• scientific article; zbMATH DE number 4075107 (Why is no real title available?)
• scientific article; zbMATH DE number 1304325 (Why is no real title available?)
• Approximating Bandwidth by Mixing Layouts of Interval Graphs
• Characterisations of intersection graphs by vertex orderings
• Bandwidth and profile minimization
• Discovering bands from graphs

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