An efficient algorithm for the configuration problem of dominance graphs (Q2768386)
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 efficient algorithm for the configuration problem of dominance graphs |
scientific article; zbMATH DE number 1699306
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An efficient algorithm for the configuration problem of dominance graphs |
scientific article; zbMATH DE number 1699306 |
Statements
24 March 2002
0 references
dominance constraints
0 references
automata theory
0 references
An efficient algorithm for the configuration problem of dominance graphs (English)
0 references
