Maximum flows and critical vertices in and/or graphs
From Semantic Portal Wiki
{{#vardefine:category|Publication}}{{#vardefine:templatename|i.publication}}{{#vardefine:package|smwbp_instance_templates}}
| Edit |
Reference: {{#vardefine:pagename|maximum flows and critical vertices in and/or graphs }}
- [[]]
bibtex
{{#vardefine:pagename|Maximum flows and critical vertices in and/or graphs }}{{#vardefine:key| }}
abstract:
download:
Facts about Maximum flows and critical vertices in and/or graphsRDF feed
| Address | London, UK + |
| Author | Yvo Desmedt +, and Yongge Wang + |
| Bibtype | inproceedings + |
| Booktitle | COCOON '02: Proceedings of the 8th Annual International Conference on Computing and Combinatorics + |
| Key | 702551 + |
| Pages | 238--248 + |
| Paper url | http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.15.3296&rep=rep1&type=pdf + |
| Publisher | Springer-Verlag + |
| Relation | AND/OR graph + |
| Tag | Computer science + |
| Title | Maximum Flows and Critical Vertices in AND/OR Graphs + |
| Year | 2002 + |
