Name
Abstract | ||
|---|---|---|
This issue marks the return of the Computing Prescriptions department; here, the authors describe an algorithm for finding minimum cutsets in connected graphs. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1109/MCSE.2009.51 | Computing in Science and Engineering |
Keywords | DocType | Volume |
computing prescriptions department,connected graph,minimum cutsets,computation,graphs,probability density function,set theory,algorithm,data mining,graph theory,algorithm design and analysis,edges,probabilistic logic | Journal | 11 |
Issue | ISSN | Citations |
3 | 1521-9615 | 0 |
PageRank | References | Authors |
0.34 | 0 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Beichl, Isabel | 1 | 63 | 22.58 |
| Francis Sullivan | 2 | 49 | 17.33 |