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

Перейти к навигации Перейти к поиску

Ниже показано до 500 результатов в диапазоне от 2001 до 2500.

Просмотреть ( | ) (20 | 50 | 100 | 250 | 500)

  1. Proper numbering
  2. Proper substring
  3. Provable problem
  4. Pruned tree
  5. Pseudo-h-hamiltonian cycle
  6. Pseudo-h-hamiltonian graph
  7. Pseudo-hamiltonian graph
  8. Pseudo-hamiltonicity number
  9. Pseudo-polynomial algorithm
  10. Pseudo-product
  11. Pseudo-wheel
  12. Pseudograceful graph
  13. Pseudograph
  14. Pseudosimilar vertices
  15. Pseudosymmetric digraph
  16. Pseudovertex
  17. Pumping lemmas
  18. Pure synthesized grammar
  19. Pushdown automaton
  20. Q-Peripheral vertex
  21. Q-Периферийная вершина
  22. Quad cycle
  23. Quadrilateral
  24. Quadtree
  25. Quasi-bipartite mixed graph
  26. Quasi-diameter
  27. Quasi-radius
  28. Quasi-transitive tournament
  29. Quasibipyramid
  30. Quasistrongly connected graph
  31. R-Circular colorable graph
  32. R-Dense tree
  33. R-Identifying code
  34. R-Плотное дерево
  35. RAM
  36. Radial path
  37. Radially critical graph
  38. Radius-essential edge
  39. Radius of a graph
  40. Ramanujan graph
  41. Ramsey edge number
  42. Ramsey graph game
  43. Ramsey number
  44. Random access machine
  45. Random graph
  46. Rank function
  47. Rank of a graph
  48. Rank of a graph group
  49. Rank of a hypergraph
  50. Rank of a matroid
  51. Ranking number
  52. Ray
  53. Reach-preservable graph
  54. Reach-preserving vertex
  55. Reachability
  56. Reachability graph
  57. Reachability matrix
  58. Reachability problem
  59. Reachability relation
  60. Reachable (from a) vertex
  61. Reachable marking
  62. Reaching matrix
  63. Reaching set
  64. Realizable admissible sequence
  65. Realization of a hypergraph
  66. Realizer of P
  67. Reasonable numbering
  68. Receiver
  69. Recognizer
  70. Reconstructible graph
  71. Reconstruction of a graph
  72. Rectangular graph
  73. Recursive nonterminal symbol
  74. Recursive set
  75. Recursively enumerable language
  76. Recursively enumerable set
  77. Redex
  78. Reduced graph
  79. Reduced hypergraph
  80. Reduced path covering
  81. Reducible additive hereditary graph property
  82. Reducible by Hecht and Ullman flow graph
  83. Reduction tree
  84. Reflexive-transitive closure of a graph
  85. Reflexive graph
  86. Reflexive relation
  87. Region of connectivity
  88. Register-interference graph
  89. Regressive bounded graph
  90. Regressive finite graph
  91. Regular Petri net
  92. Regular Petri net with finite marking
  93. Regular basic subnet
  94. Regular expression
  95. Regular expression nonequivalence problem
  96. Regular graph
  97. Regular group of a graph
  98. Regular language
  99. Regular loop
  100. Regular matroid
  101. Regular set
  102. Regular tournament
  103. Regularizable graph
  104. Relation
  105. Relation precedence
  106. Reliable relations of execution frequency
  107. Removal-similar vertices
  108. Removal of a set of vertices
  109. Removal of a vertex
  110. Removal of an edge
  111. Repeatedly executed region
  112. Repetion-free scheme
  113. Reproduction graph
  114. Restrained dominating set
  115. Restricted block duplicate graph
  116. Restricted domination number
  117. Restricted unimodular chordal graph
  118. Restriction method
  119. Restriction of a graph
  120. Restriction of a hypergraph
  121. Result
  122. Retract
  123. Retraction
  124. Retreating arc
  125. Reverse arc
  126. Reverse digraph
  127. Reverse path
  128. Rewriting rule
  129. Ridge graph
  130. Right-linear language
  131. Right-linear tree
  132. Right-sided balanced tree
  133. Rightmost derivation
  134. Rigid circuit graph
  135. Rigid graph
  136. Rim
  137. Ring-sum
  138. Roman domination
  139. Root
  140. Rooted balance
  141. Rooted graph
  142. Rooted product
  143. Rooted tree
  144. Rotational Cayley digraph
  145. Round forest
  146. Route
  147. Routing
  148. S-Gonal tree
  149. S-Topological graph
  150. S-Грамматика
  151. S-Топологический граф
  152. SNC-Грамматика
  153. SSSP problem
  154. Safe Petri net
  155. Safe place
  156. Safeness problem
  157. Satisfiability problem
  158. Saturated vertex
  159. Schema simulation
  160. Schema with distributed memory
  161. Schema with node number repetition
  162. Scheme with indirect addressing
  163. Scheme with separators
  164. Scorpion
  165. Search forest
  166. Second Order formula
  167. Section
  168. Segment
  169. Seidel characteristic polynomial
  170. Seidel spectrum
  171. Seidel switching
  172. Self-centered graph
  173. Self-complementary graph
  174. Self-converse digraph
  175. Self-loop
  176. Self-modified Petri net
  177. Self-negational signed graph
  178. Self-opposite directed graph
  179. Selfdual tournament
  180. Semantic net
  181. Semantic network
  182. Semaphore
  183. Semi-Strong Perfect Graph Conjecture
  184. Semicomplete c-partite digraph
  185. Semicomplete digraph
  186. Semicomplete multipartite digraph
  187. Semicycle
  188. Semidecidable problem
  189. Semieuler graph
  190. Semigirth
  191. Semigraph
  192. Semigroup of a graph
  193. Semihamiltonian graph
  194. Semiirreducible graph
  195. Semikernel
  196. Semikernel modulo F
  197. Semiorder
  198. Semipath
  199. Semiregular group of a graph
  200. Semisymmetric graph
  201. Sentence
  202. Sentencial form
  203. Separable graph
  204. Separating set
  205. Separating triangle
  206. Separation-width
  207. Separator
  208. Sequence
  209. Sequence of length n
  210. Sequential-alternative process
  211. Sequential-alternative process net
  212. Sequential-parallel control structure
  213. Sequential control structure
  214. Sequential process
  215. Series-parallel graph
  216. Series-parallel poset
  217. Server
  218. Set
  219. Set of firing sequences
  220. Set of priorities
  221. Set of reachable markings
  222. Shell
  223. Shortest-path distance
  224. Shortest Steiner's tree
  225. Shortest path
  226. Shortest spanning tree
  227. Shredder
  228. Sierpinski graph
  229. Sign of a graph
  230. Signed dominating function
  231. Signed domination number
  232. Signed labeled graph
  233. Signed total domination
  234. Signed total domination function
  235. Signed total domination number
  236. Sigraph
  237. Similar edges
  238. Simple chain
  239. Simple circuit
  240. Simple clique polynomial
  241. Simple cutset
  242. Simple cycle
  243. Simple edge
  244. Simple eigenvalue
  245. Simple elimination ordering
  246. Simple graph
  247. Simple hierarchical graph
  248. Simple hypergraph
  249. Simple loop
  250. Simple path
  251. Simple rotation
  252. Simple transition
  253. Simple vertex
  254. Simplicial clique
  255. Simplicial vertex
  256. Simply related paths
  257. Simply sequential numbering
  258. Single-entry zone
  259. Singular edge exchange
  260. Singularly related graphs
  261. Sink
  262. Sink-tree
  263. Size of a directed hypergraph
  264. Size of a graph
  265. Skein
  266. Skeleton graph
  267. Skewed tree
  268. Skewness of a graph
  269. Skirting cycle
  270. Skolem-graceful graph
  271. Skolem-labeling
  272. Slater number
  273. Smith graph
  274. Snark
  275. Solution of a digraph
  276. Solvable problem
  277. Son
  278. Son of a vertex
  279. Sorting tree
  280. Source
  281. Space complexity of an algorithm
  282. Span-labeling
  283. Span of f
  284. Spanning cotree
  285. Spanning forest
  286. Spanning hypertree
  287. Spanning sequence
  288. Spanning subgraph
  289. Spanning tree
  290. Spanning tree vector
  291. Spectral radius
  292. Spectrum of a graph
  293. Sperner's Lemma
  294. Sperner property
  295. Spider
  296. Split dominating set
  297. Split domination number
  298. Split graph
  299. Split isomorphism
  300. Split sequence
  301. Split tree
  302. Splitoid
  303. Splitting of a vertice
  304. Splitting off
  305. Square
  306. Square of a graph
  307. Square radical from a graph
  308. Squared graph
  309. St-граф
  310. Stability function
  311. Stability number
  312. Stable set
  313. Stable vertex set
  314. Stamen of a flower
  315. Standard form of a net
  316. Star
  317. Star-chromatic number
  318. Star-extremal graph
  319. Star coloring
  320. Starlike tree
  321. Starred graph
  322. Starred polygon
  323. Start operator
  324. Start vertex
  325. Starting node of a fragment
  326. State
  327. State-machine Petri net
  328. State of compound transition
  329. State transition diagram
  330. Status of a vertex
  331. Steiner's problem in Euclid plane
  332. Steiner's problem in graphs
  333. Steiner distance
  334. Steiner minimal tree
  335. Steiner n-center
  336. Steiner n-eccentricity
  337. Steiner point
  338. Steiner trade
  339. Stem
  340. Stochastic Petri nets
  341. Stop operator
  342. Stratified net formula
  343. Stretcher
  344. Strict partial order relation
  345. Strong B-tree
  346. Strong Helly property
  347. Strong argument
  348. Strong chromatic index
  349. Strong closure of a graph
  350. Strong component of a digraph
  351. Strong degree of a graph
  352. Strong dominating set
  353. Strong domination number
  354. Strong input
  355. Strong matching
  356. Strong orientation
  357. Strong output
  358. Strong perfect graph conjecture
  359. Strong product of graphs
  360. Strong result
  361. Strong support vertex
  362. Strong unique independence graph
  363. Strongly NP-complete problem
  364. Strongly NP-hard problem
  365. Strongly chordal graph
  366. Strongly circuit closed graph
  367. Strongly circuit connected edges
  368. Strongly circuit connected vertices
  369. Strongly coadjoint vertices
  370. Strongly connected component
  371. Strongly connected graph
  372. Strongly connected region
  373. Strongly connected vertices
  374. Strongly cyclic edge connected graph
  375. Strongly cyclically closed graph
  376. Strongly dense m-ary tree
  377. Strongly dense tree
  378. Strongly equistable graph
  379. Strongly geodetic graph
  380. Strongly non-circular grammar
  381. Strongly perfect graph
  382. Strongly quasibiconnected graph
  383. Strongly transitive graph
  384. Strongly unilateral digraph
  385. Strongly weak digraph
  386. Structured net formula
  387. Subchain
  388. Subchromatic number
  389. Subdegrees of a graph group
  390. Subdivided edge
  391. Subdivision graph
  392. Subdivision of an edge
  393. Subgraph
  394. Subgraph derivable graph
  395. Subgraph derivation
  396. Subgraph isomorphism problem
  397. Subhypergraph
  398. Submodular function (of a matroid)
  399. Submodular inequality
  400. Subnet
  401. Suborthogonal double cover
  402. Suborthogonal subgraph
  403. Substitution of a graph
  404. Substitutional closure
  405. Substring
  406. Subtree
  407. Subtree with the root r
  408. Subword
  409. Succession relation
  410. Successive coloring
  411. Successor of a vertex
  412. Suffix
  413. Sum graph
  414. Sum hypergraph
  415. Sum labeling
  416. Sum number
  417. Sum of graphs
  418. Sunlike graph
  419. Super (a,d)-edge-antimagic total graph
  420. Super (a,d)-edge-antimagic total labeling
  421. Super edge-connected graph
  422. Super point-connected graph
  423. Superconnected graph
  424. Supercritical graph
  425. Supereulerian graph
  426. Supereulerian index
  427. Supergraph
  428. Supermagic graph
  429. Superoblique graph
  430. Superperfect graph
  431. Superposition of graphs
  432. Support vertex
  433. Surviving route digraph
  434. Switch equivalent graphs
  435. Switch operation
  436. Switching
  437. Symbol
  438. Symmetric binary tree
  439. Symmetric directed graph
  440. Symmetric edge
  441. Symmetric relation
  442. Symmetric traversal
  443. Symmetrical difference of graphs
  444. Symmetrical graph
  445. Symmetrical group of a graph
  446. Synchrograph
  447. Synchronization graph
  448. Syntactical diagram
  449. Syntax analysis
  450. Syntax diagram
  451. Syntax tree
  452. System of disjoint representatives
  453. System of distinct representatives
  454. T-Code (in a graph)
  455. T-Color-critical
  456. T-Join
  457. T-Numbering
  458. T-Perfect code
  459. T-Spanner
  460. T-Tough graph
  461. T-Нумерация
  462. TREEWIDTH problem
  463. Tail of a hyperarc
  464. Tail place
  465. Target
  466. Tensor product
  467. Term
  468. Term-rewriting system
  469. Terminal alphabet
  470. Terminal edge
  471. Terminal language
  472. Terminal marking
  473. Terminal node
  474. Terminal node of a fragment
  475. Terminal state
  476. Terminal symbol
  477. Termination of a compound transition
  478. Test and decrement operator
  479. Theta-graph
  480. Thickness of a graph
  481. Threshold graph
  482. Tightened graph
  483. Tightly connected vertices
  484. Time complexity
  485. Timed Petri nets
  486. Token
  487. Tolerance graph
  488. Tolerance representation
  489. Topological graph
  490. Topological measures of program complexity
  491. Topological representation of a graph
  492. Topological sorting
  493. Toroidal graph
  494. Toroidal thickness
  495. Total Z-transformation graph
  496. Total chromatic number
  497. Total coloring
  498. Total connectivity
  499. Total dominating function
  500. Total dominating number

Просмотреть ( | ) (20 | 50 | 100 | 250 | 500)

Источник — http://pco.iis.nsk.su/grapp/index.php/Служебная:Некатегоризованные_страницы