Memory-efficient enumeration of constrained spanning trees (Q294700): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: Wikidata QID (P12): Q126471184, #quickstatements; #temporary_batch_1722421251154 |
||
| (One intermediate revision by one other user not shown) | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2017107072 / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q126471184 / rank | |||
Normal rank | |||
Latest revision as of 11:22, 31 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Memory-efficient enumeration of constrained spanning trees |
scientific article |
Statements
Memory-efficient enumeration of constrained spanning trees (English)
0 references
16 June 2016
0 references
enumeration
0 references
exhaustive search
0 references
combinatorics
0 references
optimization
0 references
algorithms
0 references
output-sensitive
0 references
graphs
0 references
spanning trees
0 references
constraints
0 references
0 references
