Q5091228 (Q5091228): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q2921660 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance-Preserving Graph Contractions / 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: Approximation Algorithms for the 0-Extension Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Programming Formulation and Approximation Algorithms for the Metric Labeling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering Problems with Hard Capacities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness results for approximating the bandwidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4780797 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4471307 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Retractions to Pseudoforests / rank
 
Normal rank
Property / cites work
 
Property / cites work: List homomorphisms to reflexive graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the bandwidth via volume respecting embeddings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952701 / 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: Q4352272 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2928707 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4828516 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5508167 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4530626 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Earthmover Distance, Metric Labeling, and 0-Extension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum 0-extensions of graph metrics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Low Distortion Maps Between Point Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for classification problems with pairwise relationships / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-edge theorem for graphs with loops / rank
 
Normal rank
Property / cites work
 
Property / cites work: A retraction problem in graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(d\)-dimensional arrangement revisited / 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: Theory of semidefinite programming for sensor network localization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compaction, Retraction, and Constraint Satisfaction / rank
 
Normal rank
Property / cites work
 
Property / cites work: A complete and equal computational complexity classification of compaction and retraction to all graphs with at most four vertices and some general results / rank
 
Normal rank

Revision as of 17:40, 29 July 2024

scientific article; zbMATH DE number 7561563
Language Label Description Also known as
English
No label defined
scientific article; zbMATH DE number 7561563

    Statements

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    21 July 2022
    0 references
    0 references
    graph algorithms
    0 references
    graph embedding
    0 references
    planar graphs
    0 references
    approximation algorithms
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references