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

Ниже показано до 50 результатов в диапазоне от 1941 до 1990.

1941. Prependant vertex
1942. Prescribed chromatic number
1943. Prime graph
1944. Prime hammock
1945. Prime labeling
1946. Primitive Petri net
1947. Primitive cycle
1948. Primitive directed graph
1949. Primitive net formula
1950. Print operator
1951. Priority
1952. Prism
1953. Private neighbor set
1954. Private neighbour
1955. Private neighbourhood
1956. Problem
1957. Problem of finite-state automaton minimization
1958. Problem size
1959. Process
1960. Process net
1961. Process net with competition
1962. Product of graphs
1963. Product of two languages
1964. Production
1965. Production grammar
1966. Profile numbering
1967. Profile of a graph
1968. Profile of numbering
1969. Profile width of a vertex
1970. Program
1971. Program dependence graph
1972. Program dependences
1973. Program equivalence
1974. Program of automaton
1975. Program optimization
1976. Program schemata
1977. Progressive bounded graph
1978. Progressive finite graph
1979. Proper (vertex) colouring
1980. Proper coloring
1981. Proper control flow graph
1982. Proper dominator
1983. Proper interval graph
1984. Proper labeling
1985. Proper matching
1986. Proper numbering
1987. Proper substring
1988. Provable problem
1989. Pruned tree
1990. Pseudo-h-hamiltonian cycle