Open AccessOn Two Problems Reducible to Topological Sorting
Author(s) -
Alan D. Kalvin
Publication year - 1984
Publication title -
the computer journal
Language(s) - French
Resource type - Journals
SCImago Journal Rank - 0.319
H-Index - 64
eISSN - 1460-2067
pISSN - 0010-4620
DOI - 10.1093/comjnl/27.2.176
Subject(s) - sorting , permutation (music) , topological sorting , sequence (biology) , computer science , combinatorics , mathematics , topology (electrical circuits) , algorithm , directed graph , biology , physics , genetics , acoustics
Les permutations de generation satisfaisant a une sequence U-D, ou ayant un nombre donne de parcours sont montrees etre restreintes a des problemes de permutations qui peuvent etre reduits a des tri topologiques. Les algorithmes pour generer les ensembles de solution de tels problemes sont soulignes
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom