New, simpler linear-time dominators algorithm

被引：0

|

作者：

AT and T Labs, Shannon Laboratory, 180 Park Ave., Florham Park, NJ 07932, United States ^{[1
]}

机构：

来源：

ACM Trans Program Lang Syst | / 6卷 / 1265-1296期

关键词：

D O I：

暂无

中图分类号：

学科分类号：

摘要：

引用

收藏

相关论文

共 50 条

[41] A linear-time algorithm for finding a maximal planar subgraph
Djidjev, Hristo N.
SIAM JOURNAL ON DISCRETE MATHEMATICS, 2006, 20 (02) : 444 - 462
[42] Linear-time algorithm to find modules of fault trees
Universite Bordeaux I, Talence, France
IEEE Trans Reliab, 3 (422-425):
[43] A Linear-Time Optimal Broadcasting Algorithm in Stars of Cliques
Damaschke, Peter
Journal of Graph Algorithms and Applications, 2024, 28 (01) : 385 - 388
[44] A LINEAR-TIME ALGORITHM FOR FINDING A MINIMUM SPANNING PSEUDOFOREST
GABOW, HN
TARJAN, RE
INFORMATION PROCESSING LETTERS, 1988, 27 (05) : 259 - 263
[45] Linear-time general decoding algorithm for the surface code
Darmawan, Andrew S.
Poulin, David
PHYSICAL REVIEW E, 2018, 97 (05)
[46] A linear-time algorithm for computing the multinomial stochastic complexity
Kontkanen, Petri
Myllymaki, Petri
INFORMATION PROCESSING LETTERS, 2007, 103 (06) : 227 - 233
[47] A linear-time algorithm to find modules of fault trees
Dutuit, Y
Rauzy, A
IEEE TRANSACTIONS ON RELIABILITY, 1996, 45 (03) : 422 - 425
[48] A LINEAR-TIME ALGORITHM FOR THE MAXIMUM MATCHING PROBLEM ON COGRAPHS
YU, MS
YANG, CH
BIT, 1993, 33 (03): : 420 - 433
[49] Linear-time algorithm for drawing a planar graph on a grid
Chrobak, M.
Payne, T.H.
Information Processing Letters, 1995, 54 (04):
[50] A Linear-Time Algorithm for the Feasibility of Pebble Motion on Trees
V. Auletta
A. Monti
M. Parente
P. Persiano
Algorithmica, 1999, 23 : 223 - 245

← 1 2 3 4 5 →