Некатегоризованные страницы
Материал из WikiGrapp
Ниже показано до 250 результатов в диапазоне от 2001 до 2250.
- Proper numbering
- Proper substring
- Provable problem
- Pruned tree
- Pseudo-h-hamiltonian cycle
- Pseudo-h-hamiltonian graph
- Pseudo-hamiltonian graph
- Pseudo-hamiltonicity number
- Pseudo-polynomial algorithm
- Pseudo-product
- Pseudo-wheel
- Pseudograceful graph
- Pseudograph
- Pseudosimilar vertices
- Pseudosymmetric digraph
- Pseudovertex
- Pumping lemmas
- Pure synthesized grammar
- Pushdown automaton
- Q-Peripheral vertex
- Q-Периферийная вершина
- Quad cycle
- Quadrilateral
- Quadtree
- Quasi-bipartite mixed graph
- Quasi-diameter
- Quasi-radius
- Quasi-transitive tournament
- Quasibipyramid
- Quasistrongly connected graph
- R-Circular colorable graph
- R-Dense tree
- R-Identifying code
- R-Плотное дерево
- RAM
- Radial path
- Radially critical graph
- Radius-essential edge
- Radius of a graph
- Ramanujan graph
- Ramsey edge number
- Ramsey graph game
- Ramsey number
- Random access machine
- Random graph
- Rank function
- Rank of a graph
- Rank of a graph group
- Rank of a hypergraph
- Rank of a matroid
- Ranking number
- Ray
- Reach-preservable graph
- Reach-preserving vertex
- Reachability
- Reachability graph
- Reachability matrix
- Reachability problem
- Reachability relation
- Reachable (from a) vertex
- Reachable marking
- Reaching matrix
- Reaching set
- Realizable admissible sequence
- Realization of a hypergraph
- Realizer of P
- Reasonable numbering
- Receiver
- Recognizer
- Reconstructible graph
- Reconstruction of a graph
- Rectangular graph
- Recursive nonterminal symbol
- Recursive set
- Recursively enumerable language
- Recursively enumerable set
- Redex
- Reduced graph
- Reduced hypergraph
- Reduced path covering
- Reducible additive hereditary graph property
- Reducible by Hecht and Ullman flow graph
- Reduction tree
- Reflexive-transitive closure of a graph
- Reflexive graph
- Reflexive relation
- Region of connectivity
- Register-interference graph
- Regressive bounded graph
- Regressive finite graph
- Regular Petri net
- Regular Petri net with finite marking
- Regular basic subnet
- Regular expression
- Regular expression nonequivalence problem
- Regular graph
- Regular group of a graph
- Regular language
- Regular loop
- Regular matroid
- Regular set
- Regular tournament
- Regularizable graph
- Relation
- Relation precedence
- Reliable relations of execution frequency
- Removal-similar vertices
- Removal of a set of vertices
- Removal of a vertex
- Removal of an edge
- Repeatedly executed region
- Repetion-free scheme
- Reproduction graph
- Restrained dominating set
- Restricted block duplicate graph
- Restricted domination number
- Restricted unimodular chordal graph
- Restriction method
- Restriction of a graph
- Restriction of a hypergraph
- Result
- Retract
- Retraction
- Retreating arc
- Reverse arc
- Reverse digraph
- Reverse path
- Rewriting rule
- Ridge graph
- Right-linear language
- Right-linear tree
- Right-sided balanced tree
- Rightmost derivation
- Rigid circuit graph
- Rigid graph
- Rim
- Ring-sum
- Roman domination
- Root
- Rooted balance
- Rooted graph
- Rooted product
- Rooted tree
- Rotational Cayley digraph
- Round forest
- Route
- Routing
- S-Gonal tree
- S-Topological graph
- S-Грамматика
- S-Топологический граф
- SNC-Грамматика
- SSSP problem
- Safe Petri net
- Safe place
- Safeness problem
- Satisfiability problem
- Saturated vertex
- Schema simulation
- Schema with distributed memory
- Schema with node number repetition
- Scheme with indirect addressing
- Scheme with separators
- Scorpion
- Search forest
- Second Order formula
- Section
- Segment
- Seidel characteristic polynomial
- Seidel spectrum
- Seidel switching
- Self-centered graph
- Self-complementary graph
- Self-converse digraph
- Self-loop
- Self-modified Petri net
- Self-negational signed graph
- Self-opposite directed graph
- Selfdual tournament
- Semantic net
- Semantic network
- Semaphore
- Semi-Strong Perfect Graph Conjecture
- Semicomplete c-partite digraph
- Semicomplete digraph
- Semicomplete multipartite digraph
- Semicycle
- Semidecidable problem
- Semieuler graph
- Semigirth
- Semigraph
- Semigroup of a graph
- Semihamiltonian graph
- Semiirreducible graph
- Semikernel
- Semikernel modulo F
- Semiorder
- Semipath
- Semiregular group of a graph
- Semisymmetric graph
- Sentence
- Sentencial form
- Separable graph
- Separating set
- Separating triangle
- Separation-width
- Separator
- Sequence
- Sequence of length n
- Sequential-alternative process
- Sequential-alternative process net
- Sequential-parallel control structure
- Sequential control structure
- Sequential process
- Series-parallel graph
- Series-parallel poset
- Server
- Set
- Set of firing sequences
- Set of priorities
- Set of reachable markings
- Shell
- Shortest-path distance
- Shortest Steiner's tree
- Shortest path
- Shortest spanning tree
- Shredder
- Sierpinski graph
- Sign of a graph
- Signed dominating function
- Signed domination number
- Signed labeled graph
- Signed total domination
- Signed total domination function
- Signed total domination number
- Sigraph
- Similar edges
- Simple chain
- Simple circuit
- Simple clique polynomial
- Simple cutset
- Simple cycle
- Simple edge
- Simple eigenvalue
- Simple elimination ordering
- Simple graph
- Simple hierarchical graph
- Simple hypergraph
- Simple loop
- Simple path
