Computing Pathwidth Faster Than 2 n (Q3656873): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q62046054, #quickstatements; #temporary_batch_1706826130171 |
Created claim: DBLP publication ID (P1635): conf/iwpec/SuchanV09, #quickstatements; #temporary_batch_1731461124002 |
||
| (3 intermediate revisions by 3 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.1007/978-3-642-11269-0_27 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2168990208 / rank | |||
Normal rank | |||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: conf/iwpec/SuchanV09 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 02:47, 13 November 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing Pathwidth Faster Than 2 n |
scientific article |
Statements
Computing Pathwidth Faster Than 2 n (English)
0 references
14 January 2010
0 references
