A Faster FPT Algorithm for Bipartite Contraction
Guillemot, Sylvain and Marx, Dániel (2013) A Faster FPT Algorithm for Bipartite Contraction. In: Lecture Notes in Computer Science, 2013-09-04 - 2013-09-06, Sophia Antipolis, Franciaország.
Full text not available from this repository.| Item Type: | Conference or Workshop Item (-) |
|---|---|
| Subjects: | Q Science > QA Mathematics and Computer Science > QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány |
| Depositing User: | EPrints Admin |
| Date Deposited: | 05 Feb 2014 12:32 |
| Last Modified: | 05 Feb 2014 15:46 |
| URI: | https://eprints.sztaki.hu/id/eprint/7665 |
![]() |
Update Item |



