Computing minimum distortion embeddings into a path for bipartite permutation graphs and threshold graphs (Q631789): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| 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 | |||
Revision as of 19:22, 19 March 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
