[CITATION][C] An O (n^ 2) algorithm for the 2-chain problem on certain classes of perfect graphs

T Ma�- Proc. 2nd ACM-SIAM Symp. on Discrete Algorithms, 1991 - cir.nii.ac.jp
An O(n^2) algorithm for the 2-chain problem on certain classes of perfect graphs | CiNii
Research … An O(n^2) algorithm for the 2-chain problem on certain classes of perfect
graphs … on Discrete Algorithms 1991 …
Save Cite Cited by 12 Related articles Cached
Showing the best result for this search. See all results