|
| Keyword : extreme vertex set
|
Computing a Minimum Cut in a Graph with Dynamic Edges Incident to a Designated Vertex
Hiroshi NAGAMOCHI | Publication: IEICE TRANSACTIONS on Information and Systems
Publication Date: 2007/02/01
Vol. E90-D
No. 2 ;
pp. 428-431
Type of Manuscript:
Special Section PAPER (Special Section on Foundations of Computer Science)
Category: Graph Algorithms
Keyword:
dynamic graph, edge-connectivity, extreme vertex set, graph algorithm, | | | Summary | Full Text:PDF | |
|
|