An improved upper bound on maximal clique listing via rectangular fast matrix multiplication (Q1799209)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An improved upper bound on maximal clique listing via rectangular fast matrix multiplication |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An improved upper bound on maximal clique listing via rectangular fast matrix multiplication |
scientific article |
Statements
An improved upper bound on maximal clique listing via rectangular fast matrix multiplication (English)
0 references
18 October 2018
0 references
maximal clique listing
0 references
rectangular fast matrix multiplication
0 references
output sensitive
0 references
polynomial time delay
0 references
reverse search enumeration
0 references
0 references
0 references
0.7669945359230042
0 references
0.7567209005355835
0 references
0.753635585308075
0 references
0.7533131241798401
0 references
0.7448729276657104
0 references
