Reachability in K 3,3-Free Graphs and K 5-Free Graphs Is in Unambiguous Log-Space (Q3183622): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 05:56, 4 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Reachability in K 3,3-Free Graphs and K 5-Free Graphs Is in Unambiguous Log-Space |
scientific article |
Statements
Reachability in K 3,3-Free Graphs and K 5-Free Graphs Is in Unambiguous Log-Space (English)
0 references
20 October 2009
0 references
