An \(O(|S|\times|T|)\)-algorithm to verify if a net is regular (Q4633174)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7049856
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An \(O(|S|\times|T|)\)-algorithm to verify if a net is regular |
scientific article; zbMATH DE number 7049856 |
Statements
An O(¦S¦ × ¦T¦)-algorithm to verify if a net is regular (English)
0 references
2 May 2019
0 references
expressive power
0 references
minimal cover
0 references
cluster graph
0 references
output place
0 references
rank theorem
0 references
0.7736930847167969
0 references
0.7598680257797241
0 references
0.757434606552124
0 references
0.757434606552124
0 references
