Approximating the bandwidth of caterpillars (Q2391175)

From MaRDI portal

Revision as of 19:31, 1 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)

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

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Approximating the bandwidth of caterpillars	scientific article

Statements

scholarly article

0 references

Approximating the bandwidth of caterpillars (English)

0 references

0 references

0 references

0 references

publication date

24 July 2009

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/s00453-007-9002-0

0 references

The bandwidth problem for graphs and matrices—a survey

0 references

Graphs with small bandwidth and cutwidth

0 references

0 references

Approximating the bandwidth via volume respecting embeddings

0 references

0 references

Improved Bandwidth Approximation for Trees and Chordal Graphs

0 references

Bandwidth Minimization: An approximation algorithm for caterpillars

0 references

Measured descent: A new embedding method for finite metrics

0 references

The Bandwidth Minimization Problem for Caterpillars with Hair Length 3 is NP-Complete

0 references

Dynamic-Programming Algorithms for Recognizing Small-Bandwidth Graphs in Polynomial Time

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/s00453-007-9002-0

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2391175

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