A linear-time algorithm to find a separator in a graph excluding a minor (Q2930265): Difference between revisions
From MaRDI portal
Changed an Item |
Created claim: Wikidata QID (P12): Q56235112, #quickstatements; #temporary_batch_1711574657256 |
||
| (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.1145/1597036.1597043 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2030012922 / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q56235112 / rank | |||
Normal rank | |||
Latest revision as of 00:21, 28 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A linear-time algorithm to find a separator in a graph excluding a minor |
scientific article |
Statements
A linear-time algorithm to find a separator in a graph excluding a minor (English)
0 references
18 November 2014
0 references
minor graphs
0 references
separator
0 references
