Computing minimum distortion embeddings into a path for bipartite permutation graphs and threshold graphs (Q631789): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 08:19, 30 January 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
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
