A fast search algorithm for the quorumcast routing problem. (Q2583541): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q293432 |
Set OpenAlex properties. |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / author | |||
Property / author: Chor-Ping Low / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A note on two problems in connexion with graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: How to assign votes in a distributed system / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Steiner problem in networks: A survey / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/s0020-0190(98)00033-7 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1983503534 / rank | |||
Normal rank |
Latest revision as of 11:59, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A fast search algorithm for the quorumcast routing problem. |
scientific article |
Statements
A fast search algorithm for the quorumcast routing problem. (English)
0 references
17 January 2006
0 references
Algorithms
0 references
Quorumcast routing
0 references
Multicast
0 references
Exhaustive search algorithm
0 references
Pruning search space
0 references
NP-completeness
0 references