Maximum directed cuts in acyclic digraphs
Bollobas, Bela and Gyárfás, András (2007) Maximum directed cuts in acyclic digraphs. Journal of Graph Theory, 55. pp. 1-13.
Full text not available from this repository.| Item Type: | Article | 
|---|---|
| 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: | 11 Dec 2012 15:32 | 
| Last Modified: | 11 Dec 2012 15:32 | 
| URI: | https://eprints.sztaki.hu/id/eprint/5625 | 
![]()  | 
			Update Item | 
        


