New polynomial delay bounds for maximal subgraph enumeration by proximity search (Q5212857): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2951327881 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 22:43, 19 March 2024
scientific article; zbMATH DE number 7160590
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | New polynomial delay bounds for maximal subgraph enumeration by proximity search |
scientific article; zbMATH DE number 7160590 |
Statements
New polynomial delay bounds for maximal subgraph enumeration by proximity search (English)
0 references
30 January 2020
0 references
graph enumeration
0 references
polynomial delay
0 references
proximity search
0 references
