Некатегоризованные страницы

Ниже показано до 250 результатов в диапазоне от 1 до 250.

1. (Abstract) syntax representation
2. (Informationally) connected operands
3. (Informationally) incompatible operands
4. (L,Y)-Bunch
5. (L,Y)-Связка
6. (Strong) equivalence of schemas
7. (X,Y)-Intersection graphs
8. (X,Y)-Графы пересечений
9. (a,b)-Cut
10. (a,b)-Linear class of graphs
11. (a,b)-Panconnected graph
12. (a,b)-Planar graph
13. (a,b)-Separator
14. (a,b)-Vertex pancyclic graph
15. (a,b)-Плоский граф
16. (a,d)-Edge-antimagic total graph
17. (a,d)-Edge-antimagic total labeling
18. (a,d)-Face antimagic graph
19. (g,f)-Factor
20. (g,f)-Factorization
21. (g,f)-Graph
22. (k,d)-Arithmetic graph
23. (k,d)-Arithmetic numbering
24. (k,d)-Coloring
25. (k,d)-Раскраска
26. (k,g)-Cage
27. (p,q)-Graceful signed graph
28. (r,s)-Regular graph
29. (t,i,j)-Cover
30. (Абстрактное) синтаксическое дерево
31. (Абстрактное) синтаксическое представление
32. 0-Chain of a graph
33. 0-Цепь графа
34. 1-2-Братское дерево
35. 1-2 Brother tree
36. 1-Base
37. 1-Chain of a graph
38. 1-Chordal graph
39. 1-Factor
40. 1-Factorization of K 2n
41. 1-Tree
42. 1-edge hamiltonian graph
43. 1-База
44. 1-Дерево
45. 1-Цепь графа
46. 2-3-Tree
47. 2-3-Дерево
48. 2-3 Brother tree
49. 2-Connected graph
50. 2-Packing number
51. 2-Packing of a graph
52. 2-Pebbling property
53. 2-Section graph
54. 2-Switch
55. 2-Секционный граф
56. 3-Combination problem
57. 3-set exact cover problem
58. 3-Раскрашиваемость
59. 5-Flow conjecture
60. A-reprezentation of a cf-graph
61. A-граф
62. A-представление уграфа
63. ANC-Грамматика
64. AT-Free graph
65. AVL-Tree
66. Abdiff-tolerance competition graph
67. Absolute hypergraph
68. Absolute incenter
69. Absolute inner radius
70. Absolute median
71. Absolute of a rooted tree
72. Absolute outcenter
73. Absolute outer radius
74. Absolute retract
75. Absorbant set
76. Absorbent set
77. Abstract computer
78. Abstract graph
79. Abstract machine
80. Abstract syntax tree
81. Acceptable assignment
82. Access term
83. Achromatic number
84. Achromatic status
85. Ackermann's function
86. Acyclic chromatic number
87. Acyclic colouring
88. Acyclic dominating set
89. Acyclic domination number
90. Acyclic orientation
91. Additive hereditary graph property
92. Addressable transformation graph
93. Addressing scheme
94. Adjacency
95. Adjacency list
96. Adjacency matrix
97. Adjacency operator
98. Adjacency property
99. Adjacent arcs
100. Adjacent edges
101. Adjacent faces
102. Adjacent forest graph
103. Adjacent graphs
104. Adjacent vertices
105. Adjoint digraph
106. Admissible sequence
107. Advancing arc
108. Algebraic connectivity
109. Algebraic graph theory
110. Algorithm
111. Alive Petri net
112. Almost 3-regular
113. Almost cubic graph
114. Alpha-Acyclic hypergraph
115. Alpha-Cyclic hypergraph
116. Alphabet
117. Alt
118. Alternating chain
119. Amalgam
120. Amalgamation of a graph
121. Amallamorphic graphs
122. Amount of a flow
123. Anarboricity of a graph
124. Ancestor of a vertex
125. Animal
126. Annihilator
127. Anti-gem
128. Antichain
129. Anticlique
130. Antidependence
131. Antidirected Hamiltonian cycle
132. Antidirected Hamiltonian path
133. Antidirected path
134. Antihole
135. Antimagic graph
136. Antiparallel arcs
137. Antiprism
138. Antisymmetric graph
139. Antisymmetric relation
140. Apex graph
141. Approximable problem
142. Approximate point spectrum
143. Approximation algorithm
144. Arbitrarily hamiltonian graph
145. Arbitrarily traceable graph
146. Arbitrarily traverseable graph
147. Arbitrarily vertex decomposable graph
148. Arboreal hypergraph
149. Arborescence
150. Arboricity of a graph
151. Arc-forwarding index
152. Arc base
153. Argument
154. Arithmetic graph
155. Arrangeable alt
156. Arrangement
157. Articulation point
158. Articulation set
159. Assignment problem
160. Associated Cayley digraph
161. Associated undirected graph
162. Associative search
163. Asteroidal number
164. Asteroidal set
165. Asteroidal triple
166. Asymmetric graph
167. Asymmetric relation
168. Atomic formula
169. Attachment graph
170. Attribute grammar
171. Attribute tree
172. Augmented adjacency matrix
173. Augmenting chain
174. Automata theory
175. Automorphism
176. Automorphism group
177. Automorphism problem
178. Average connectivity
179. Average domination number
180. Average independent domination number
181. B-Tree
182. B-Дерево
183. B-дерево (дерево многоканального поиска)
184. B-деревья без явного задания параметров кэша
185. BB-Tree
186. BB-Дерево
187. Back-edge
188. Backbone
189. Backbone coloring
190. Backbone coloring number
191. Backward arc
192. Balance of a vertex
193. Balanced circuit
194. Balanced digraph
195. Balanced graph
196. Balanced hypergraph
197. Balanced signed graph
198. Ball number
199. Bandwidth
200. Bandwidth sum
201. Bar-visibility graph
202. Base digraph
203. Base of a directed graph
204. Base of a matroid
205. Based graph
206. Basic block
207. Basic cycle
208. Basic cycle set
209. Basic numberings
210. Basis number
211. Basis of a digraph
212. Beraha number
213. Berge's Formula
214. Berge's complete graph
215. Berge's conjecture
216. Berge graph
217. Bi-Helly family
218. Biblock
219. Bicenter
220. Bicenter tree
221. Bicentre
222. Bicentroid of a tree
223. Bichordal bipartite graph
224. Bichromatic graph
225. Bichromatic hypergraph
226. Biclique
227. Biclique edge cover
228. Biclique edge covering number
229. Biclique number
230. Bicoloured subgraph
231. Bicomponent
232. Biconnected component
233. Biconvex bipartite graph
234. Bicritical graph
235. Bicubic graph
236. Bidirectional arcs
237. Bifurcant
238. Bigraph
239. Bihypergraph
240. Binary Hamming graph
241. Binary de Bruijn graph
242. Binary matroid
243. Binary n-dimensional cube
244. Binary relation
245. Binary search tree
246. Binary sorting tree
247. Binary split tree
248. Binary tree
249. Binary vertex
250. Binode