Hardness and approximation for L-EPG and \(B_1\)-EPG graphs (Q2184686)
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: Hardness and approximation for L-EPG and B₁-EPG graphs |
scientific article; zbMATH DE number 7206541
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Hardness and approximation for L-EPG and \(B_1\)-EPG graphs |
scientific article; zbMATH DE number 7206541 |
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
0 references
0 references
0.917280614376068
0 references
0.8883957266807556
0 references
0.8793813586235046
0 references
0.8700602650642395
0 references
0.8382248878479004
0 references
