An extremal graph with given bandwidth (Q884479)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	An extremal graph with given bandwidth	scientific article

Statements

scholarly article

0 references

An extremal graph with given bandwidth (English)

0 references

0 references

0 references

Theoretical Computer Science

0 references

publication date

6 June 2007

0 references

zbMATH Keywords

bandwidth

0 references

extremal graph

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.tcs.2007.03.012

0 references

0 references

The bandwidth problem for graphs and matrices—a survey

0 references

0 references

On the size of graphs of a given bandwidth

0 references

Complexity Results for Bandwidth Minimization

0 references

0 references

A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs

0 references

The NP-completeness of the bandwidth minimization problem

0 references

0 references

Identifiers

zbMATH Open document ID

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

10.1016/J.TCS.2007.03.012

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:884479

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q884479&oldid=38520776"