An O(¦S¦ × ¦T¦)-algorithm to verify if a net is regular (Q4633174): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 15:19, 7 February 2024
scientific article; zbMATH DE number 7049856
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An O(¦S¦ × ¦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
