An Efficient Test for Circular-Arc Graphs (Q3900112): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q1171065 |
Created claim: Wikidata QID (P12): Q60307435, #quickstatements; #temporary_batch_1714786519576 |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / author | |||
| Property / author: Alan C. Tucker / rank | |||
Normal rank | |||
| 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.1137/0209001 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1980392938 / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q60307435 / rank | |||
Normal rank | |||
Latest revision as of 03:21, 4 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An Efficient Test for Circular-Arc Graphs |
scientific article |
Statements
An Efficient Test for Circular-Arc Graphs (English)
0 references
1980
0 references
intersection graphs
0 references
circular-arc graph
0 references
circular arc's property
0 references
consecutive arc's property
0 references
algorithms
0 references
