|
Volumn 271, Issue 1-3, 2003, Pages 261-270
|
Erratum to “Ranking by outdegree for directed graphs” (Ranking by outdegree for directed graphs (2003) 271(1–3) (261–270), (S0012365X03000505), (10.1016/S0012-365X(03)00050-5));Ranking by outdegree for directed graphs
|
Author keywords
Copeland score; Directed graphs; Outdegree; Ranking method; Top cycle
|
Indexed keywords
COMPUTATION THEORY;
PROBLEM SOLVING;
SET THEORY;
DIRECTED GRAPHS;
GRAPH THEORY;
|
EID: 0042890373
PISSN: 0012365X
EISSN: None
Source Type: Journal
DOI: 10.1016/j.disc.2018.08.014 Document Type: Erratum |
Times cited : (22)
|
References (9)
|