Yvo Desmedt, Yongge Wang. Maximum Flows and Critical Vertices in AND/OR Graphs. In Oscar H. Ibarra, Louxin Zhang, editors, Computing and Combinatorics, 8th Annual International Conference, COCOON 2002, Singapore, August 15-17, 2002, Proceedings. Volume 2387 of Lecture Notes in Computer Science, pages 238-248, Springer, 2002. [doi]
@inproceedings{DesmedtW02,
title = {Maximum Flows and Critical Vertices in AND/OR Graphs},
author = {Yvo Desmedt and Yongge Wang},
year = {2002},
url = {http://link.springer.de/link/service/series/0558/bibs/2387/23870238.htm},
tags = {data-flow, graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/DesmedtW02},
cites = {0},
citedby = {0},
pages = {238-248},
booktitle = {Computing and Combinatorics, 8th Annual International Conference, COCOON 2002, Singapore, August 15-17, 2002, Proceedings},
editor = {Oscar H. Ibarra and Louxin Zhang},
volume = {2387},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-43996-X},
}