MOD-CHAR: an implementation of Char's spanning tree enumeration algorithm and its complexity analysis (Q4733403): 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: W2144873820 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 22:45, 19 March 2024
scientific article; zbMATH DE number 4119622
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | MOD-CHAR: an implementation of Char's spanning tree enumeration algorithm and its complexity analysis |
scientific article; zbMATH DE number 4119622 |
Statements
MOD-CHAR: an implementation of Char's spanning tree enumeration algorithm and its complexity analysis (English)
0 references
1989
0 references
spanning tree
0 references
enumeration problems
0 references
