Hardness and approximation for L-EPG and \(B_1\)-EPG graphs (Q2184686): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (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.dam.2019.10.004 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2982485164 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 20:07, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Hardness and approximation for L-EPG and \(B_1\)-EPG graphs |
scientific article |
Statements
Hardness and approximation for L-EPG and \(B_1\)-EPG graphs (English)
0 references
29 May 2020
0 references
B1-EPG graphs
0 references
edge intersection graph
0 references
paths on a grid
0 references
fully-subdivided graphs
0 references
\(k\)-simplicial graphs
0 references
