Algorithm of finding cutsets of sparse simple connected graphs

被引：0

|

作者：

机构：

来源：

Jiche Dianchuandong | / 2卷 / 3-5期

关键词：

D O I：

暂无

中图分类号：

学科分类号：

摘要：

引用

收藏

相关论文

共 50 条

[21] Perfect Graphs, Partitionable Graphs and Cutsets
Michele Conforti
Gérard Cornuéjols
Grigor Gasparyan
Kristina Vušković
Combinatorica, 2002, 22 : 19 - 33
[22] A SIMPLE AND EFFICIENT ALGORITHM FOR DETERMINING ISOMORPHISM OF PLANAR TRIPLY CONNECTED GRAPHS
WEINBERG, L
IEEE TRANSACTIONS ON CIRCUIT THEORY, 1966, CT13 (02): : 142 - +
[23] MATCHING CUTSETS IN GRAPHS
MOSHI, AM
JOURNAL OF GRAPH THEORY, 1989, 13 (05) : 527 - 536
[24] Cutsets in infinite graphs
Timar, Adam
COMBINATORICS PROBABILITY & COMPUTING, 2007, 16 (01): : 159 - 166
[25] COLORING GRAPHS WITH STABLE CUTSETS
TUCKER, A
JOURNAL OF COMBINATORIAL THEORY SERIES B, 1983, 34 (03) : 258 - 267
[26] VERTEX CUTSETS OF UNDIRECTED GRAPHS
PATVARDHAN, C
PRASAD, VC
PYARA, VP
IEEE TRANSACTIONS ON RELIABILITY, 1995, 44 (02) : 347 - 353
[27] Skewness of graphs with small cutsets
Farr, G
Eades, P
GRAPHS AND COMBINATORICS, 2003, 19 (02) : 177 - 194
[28] Diagnosis of wiring networks: An optimal randomized algorithm for finding connected components of unknown graphs
Shi, WP
West, DB
SIAM JOURNAL ON COMPUTING, 1999, 28 (05) : 1541 - 1551
[29] A LINEAR ALGORITHM FOR FINDING HAMILTONIAN CYCLES IN 4-CONNECTED MAXIMAL PLANAR GRAPHS
ASANO, T
KIKUCHI, S
SAITO, N
DISCRETE APPLIED MATHEMATICS, 1984, 7 (01) : 1 - 15
[30] A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs
Baswana, Surender
Sen, Sandeep
RANDOM STRUCTURES & ALGORITHMS, 2007, 30 (04) : 532 - 563

← 1 2 3 4 5 →