Linear time algorithms for graph search and connectivity determination on complement graphs. (Q2583566): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q56474992, #quickstatements; #temporary_batch_1705505032956 |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 09:06, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Linear time algorithms for graph search and connectivity determination on complement graphs. |
scientific article |
Statements
Linear time algorithms for graph search and connectivity determination on complement graphs. (English)
0 references
17 January 2006
0 references
Algorithms
0 references
Computational complexity
0 references
Complement graph
0 references
Graph search
0 references
Graph representation
0 references
Connectivity
0 references
