Algorithm of finding cutsets of sparse simple connected graphs

被引：0

|

作者：

机构：

来源：

Jiche Dianchuandong | / 2卷 / 3-5期

关键词：

D O I：

暂无

中图分类号：

学科分类号：

摘要：

引用

收藏

相关论文

共 50 条

[1] A PARALLEL ALGORITHM FOR FINDING MINIMUM CUTSETS IN REDUCIBLE GRAPHS
DEKEL, E
HU, J
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 1994, 20 (01) : 43 - 55
[2] LINEAR TIME ALGORITHM FOR FINDING MINIMUM CUTSETS IN REDUCIBLE GRAPHS
SHAMIR, A
SIAM JOURNAL ON COMPUTING, 1979, 8 (04) : 645 - 655
[3] On a simple randomized algorithm for finding a 2-factor in sparse graphs
Pandurangan, G
INFORMATION PROCESSING LETTERS, 2005, 95 (01) : 321 - 327
[4] Quantum Algorithm for Triangle Finding in Sparse Graphs
François Le Gall
Shogo Nakajima
Algorithmica, 2017, 79 : 941 - 959
[5] Quantum Algorithm for Triangle Finding in Sparse Graphs
Le Gall, Francois
Nakajima, Shogo
ALGORITHMS AND COMPUTATION, ISAAC 2015, 2015, 9472 : 590 - 600
[6] Quantum Algorithm for Triangle Finding in Sparse Graphs
Le Gall, Francois
Nakajima, Shogo
ALGORITHMICA, 2017, 79 (03) : 941 - 959
[7] A CONTRACTION ALGORITHM FOR FINDING SMALL CYCLE CUTSETS
LEVY, H
LOW, DW
JOURNAL OF ALGORITHMS, 1988, 9 (04) : 470 - 493
[8] A simple linear time algorithm for finding even triangulations of 2-connected bipartite plane graphs
Zhang, HM
He, X
ALGORITHMS-ESA 2002, PROCEEDINGS, 2002, 2461 : 902 - 913
[9] An algorithm for generating minimal cutsets of undirected graphs
Yong Yeon Shin
Jai Sang Koh
Korean Journal of Computational & Applied Mathematics, 1998, 5 (3): : 681 - 693
[10] A faster algorithm for finding maximum independent sets in sparse graphs
Fürer, M
LATIN 2006: THEORETICAL INFORMATICS, 2006, 3887 : 491 - 501

← 1 2 3 4 5 →