كتاب إلكتروني
An O ∗ (1.4786 n )-Time Algorithm for the Maximum Induced Matching Problem
| العنوان: | An O ∗ (1.4786 n )-Time Algorithm for the Maximum Induced Matching Problem |
|---|---|
| المؤلفون: | Chang, Maw-ShangAff1, Hung, Ling-JuAff1, Miau, Chau-AnAff2 |
| المساهمون: | Chang, Ruay-Shiung, editorAffID1, Jain, Lakhmi C., editorAffID2, Peng, Sheng-Lung, editorAffID3 |
| المصدر: | Advances in Intelligent Systems and Applications - Volume 1 : Proceedings of the International Computer Symposium ICS 2012 Held at Hualien, Taiwan, December 12–14, 2012. 20:49-58 |
| قاعدة البيانات: | Springer Nature eBooks |
Full Text Finder | ردمك: | 9783642354519 9783642354526 |
|---|---|
| DOI: | 10.1007/978-3-642-35452-6_7 |