Computing minimum distortion embeddings into a path for bipartite permutation graphs and threshold graphs (Q631789): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2011.01.005 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2033622225 / 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: Q2934633 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distortion Is Fixed Parameter Tractable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear discrepancy and bandwidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic graph theory and perfect graphs / 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: Hardness and approximation of minimum distortion embeddings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Low distortion maps between point sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the Bandwidth of Interval Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal greedy algorithms for indifference graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Threshold graphs and related topics / 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: Q2921659 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5588432 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bipartite permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An $O( n \log n )$ Algorithm for Bandwidth of Interval Graphs / rank
 
Normal rank

Latest revision as of 21:36, 3 July 2024

scientific article
Language Label Description Also known as
English
Computing minimum distortion embeddings into a path for bipartite permutation graphs and threshold graphs
scientific article

    Statements

    Computing minimum distortion embeddings into a path for bipartite permutation graphs and threshold graphs (English)
    0 references
    0 references
    0 references
    0 references
    14 March 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    graph algorithms
    0 references
    embedding into a path
    0 references
    distortion
    0 references
    polynomial-time algorithms
    0 references
    forbidden induced subgraphs characterisation
    0 references
    bipartite permutation graphs
    0 references
    threshold graphs
    0 references
    0 references