UCL logo

UCL Discovery

UCL home » Library Services » Electronic resources » UCL Discovery

Maximum Flows and Critical Vertices in AND/OR Graphs.

Desmedt, Y; Wang, Y; (2002) Maximum Flows and Critical Vertices in AND/OR Graphs. In: Ibarra, OH and Zhang, L, (eds.) COCOON. (pp. 238 - 248). Springer

Full text not available from this repository.


Type:Proceedings paper
Title:Maximum Flows and Critical Vertices in AND/OR Graphs.
ISBN:3-540-43996-X
DOI:10.1007/3-540-45655-4_27
Publisher version:http://www.informatik.uni-trier.de/~ley/db/conf/cocoon/cocoon2002.html
UCL classification:UCL > School of BEAMS > Faculty of Engineering Science > Computer Science

Archive Staff Only: edit this record