Line-distortion, bandwidth and path-length of a graph (Q521805): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W1608829409 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1409.8389 / rank
 
Normal rank
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: On the complexity of computing treelength / rank
 
Normal rank
Property / cites work
 
Property / cites work: Low-distortion embeddings of general metrics into the line / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921660 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bandwidth of bipartite permutation graphs in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asteroidal Triple-Free Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Time Algorithms for Dominating Pairs in Asteroidal Triple-free Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4947393 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree-decompositions with bags of small diameter / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation algorithm for the tree \(t\)-spanner problem on unweighted graphs via generalized chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Line-Distortion, Bandwidth and Path-Length of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness results for approximating the bandwidth / 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: Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distortion is Fixed Parameter Tractable / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for minimum distortion embedding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incidence matrices and interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Characterization of Comparability Graphs and of Interval Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bandwidth on AT-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparability graphs and intersection graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Bandwidth Approximation for Trees and Chordal Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness and approximation of minimum distortion embeddings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing minimum distortion embeddings into a path for bipartite permutation graphs and threshold graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bandwidth of convex bipartite graphs and related graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3836524 / 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: Approximating Bandwidth by Mixing Layouts of Interval Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the 2-Chain Subgraph Cover and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501778 / 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: An optimal greedy heuristic to color interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. I. Excluding a forest / rank
 
Normal rank
Property / cites work
 
Property / cites work: An $O( n \log n )$ Algorithm for Bandwidth of Interval Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some properties of invariant sets of a flow / rank
 
Normal rank

Latest revision as of 16:56, 13 July 2024

scientific article
Language Label Description Also known as
English
Line-distortion, bandwidth and path-length of a graph
scientific article

    Statements

    Line-distortion, bandwidth and path-length of a graph (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    12 April 2017
    0 references
    approximation algorithms
    0 references
    minimum line-distortion
    0 references
    minimum bandwidth
    0 references
    Robertson-Seymour's path-decomposition
    0 references
    path-length
    0 references
    AT-free graphs
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references