|
| Keyword : edge-connectivity
|
A Note on Enumeration of 3-Edge-Connected Spanning Subgraphs in Plane Graphs
Yasuko MATSUI Kenta OZEKI | Publication:
Publication Date: 2021/03/01
Vol. E104-D
No. 3 ;
pp. 389-391
Type of Manuscript:
Special Section LETTER (Special Section on Foundations of Computer Science — New Trends of Theory of Computation and Algorithm —)
Category:
Keyword:
enumeration, algorithm, spanning subgraph, edge-connectivity, | | | Summary | Full Text:PDF | |
| |
| |
| |
| |
| |
|
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 | |
| |
| |
| |
| |
| |
| |
| |
|
|
