32:
27:
163:
38:
45:
158:
58:
133:
125:
93:
80:
152:
97:
20:
112:
138:
129:
113:"Enumeration of the Elementary Circuits of a Directed Graph"
19:
may refer to one of several algorithms attributed to
33:
Tarjan's off-line lowest common ancestors algorithm
111:
79:
28:Tarjan's strongly connected components algorithm
8:
81:"A Note on Finding the Bridges of a Graph"
137:
70:
7:
14:
44:Tarjan's algorithm for finding
37:Tarjan's algorithm for finding
86:Information Processing Letters
1:
98:10.1016/0020-0190(74)90003-9
180:
110:Tarjan, Robert E. (1972),
78:Tarjan, Robert E. (1974),
164:Mathematics-related lists
118:SIAM Journal on Computing
41:in an undirected graph
48:in a directed graph
59:List of algorithms
17:Tarjan's algorithm
171:
143:
142:
141:
115:
107:
101:
100:
83:
75:
179:
178:
174:
173:
172:
170:
169:
168:
149:
148:
147:
146:
130:10.1137/0202017
109:
108:
104:
77:
76:
72:
67:
55:
46:simple circuits
12:
11:
5:
177:
175:
167:
166:
161:
151:
150:
145:
144:
124:(3): 211–216,
102:
92:(6): 160–161,
69:
68:
66:
63:
62:
61:
54:
51:
50:
49:
42:
35:
30:
13:
10:
9:
6:
4:
3:
2:
176:
165:
162:
160:
157:
156:
154:
140:
135:
131:
127:
123:
119:
114:
106:
103:
99:
95:
91:
87:
82:
74:
71:
64:
60:
57:
56:
52:
47:
43:
40:
36:
34:
31:
29:
26:
25:
24:
23:, including:
22:
21:Robert Tarjan
18:
121:
117:
105:
89:
85:
73:
16:
15:
159:Algorithms
153:Categories
65:References
139:1813/5941
53:See also
39:bridges
134:hdl
126:doi
94:doi
155::
132:,
120:,
116:,
88:,
84:,
136::
128::
122:2
96::
90:2
Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.