Computing minimum distortion embeddings into a path for bipartite permutation graphs and threshold graphs (Q631789)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Computing minimum distortion embeddings into a path for bipartite permutation graphs and threshold graphs |
scientific article; zbMATH DE number 5865606
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing minimum distortion embeddings into a path for bipartite permutation graphs and threshold graphs |
scientific article; zbMATH DE number 5865606 |
Statements
Computing minimum distortion embeddings into a path for bipartite permutation graphs and threshold graphs (English)
0 references
14 March 2011
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.9911503791809082
0 references
0.8688755035400391
0 references
0.8327695727348328
0 references
0.830206573009491
0 references
0.8288303017616272
0 references
