Approximating the bandwidth via volume respecting embeddings (Q1577009): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The Bandwidth of Caterpillars with Hairs of Length 1 and 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Beyond <i>NP</i>-completeness for problems of bounded width (extended abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Lipschitz embedding of finite metric spaces in Hilbert space / rank
 
Normal rank
Property / cites work
 
Property / cites work: The bandwidth problem for graphs and matrices—a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs with small bandwidth and cutwidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: The bandwidth problem and operations on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Johnson-Lindenstrauss lemma and the sphericity of some graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity Results for Bandwidth Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3664299 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved dynamic programming algorithms for bandwidth minimization and the MinCut Linear Arrangement problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bandwidth Minimization: An approximation algorithm for caterpillars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the Bandwidth of Interval Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the bandwidth for asteroidal triple-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3935355 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3751649 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4871767 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The geometry of graphs and some of its algorithmic applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic theory of finite dimensional normed spaces. With an appendix by M. Gromov: Isoperimetric inequalities in Riemannian manifolds / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Bandwidth Minimization Problem for Caterpillars with Hair Length 3 is NP-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-completeness of the bandwidth minimization problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5845761 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic-Programming Algorithms for Recognizing Small-Bandwidth Graphs in Polynomial Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Probable Performance of Heuristics for Bandwidth Minimization / rank
 
Normal rank

Latest revision as of 12:30, 30 May 2024

scientific article
Language Label Description Also known as
English
Approximating the bandwidth via volume respecting embeddings
scientific article

    Statements

    Approximating the bandwidth via volume respecting embeddings (English)
    0 references
    0 references
    27 August 2000
    0 references
    volume respecting embeddings
    0 references
    small distortion embeddings
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers