Transversals of subtree hypergraphs and the source location problem in digraphs (Q5449666): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4236558919 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5687198 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 19:07, 27 June 2024
scientific article; zbMATH DE number 5248271
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Transversals of subtree hypergraphs and the source location problem in digraphs |
scientific article; zbMATH DE number 5248271 |
Statements
Transversals of subtree hypergraphs and the source location problem in digraphs (English)
0 references
12 March 2008
0 references
hypertree
0 references
polynomial algorithm
0 references
