When can graph hyperbolicity be computed in linear time? (Q5920105): Difference between revisions
From MaRDI portal
Created a new Item |
Created claim: DBLP publication ID (P1635): conf/wads/FluschnikKMNNT17, #quickstatements; #temporary_batch_1736366690727 |
||
| (5 intermediate revisions by 5 users not shown) | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q62039063 / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2592125861 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1702.06503 / rank | |||
Normal rank | |||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: conf/wads/FluschnikKMNNT17 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 22:07, 8 January 2025
scientific article; zbMATH DE number 6778724
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | When can graph hyperbolicity be computed in linear time? |
scientific article; zbMATH DE number 6778724 |
Statements
When can graph hyperbolicity be computed in linear time? (English)
0 references
22 September 2017
0 references
