Calculating a Relational Program for Transitive Reductions of Strongly Connected Graphs
ReIMICS '01 Revised Papers from the 6th International Conference and 1st Workshop of COST Action 274 TARSKI on Relational Methods in Computer Science
The minimum spanning strong subdigraph problem is fixed parameter tractable
Discrete Applied Mathematics
Hi-index | 0.00 |