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

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

601. Cyclomatic number
602. D-Decomposition
603. D-Dimensional c-ary array
604. D-Dimensional c-ary clique
605. D-Dimensional lattice
606. D-Regular tree with boundary
607. D-improper list chromatic number
608. DAG (Directed Acyclic Graph)
609. DFS
610. DFS-tree
611. Dag for basic block
612. Dag of control flow graph
613. Data dependence
614. Data dependence graph
615. Data flow analysis frameworks
616. Data flow analysis problem
617. Data set
618. Data term
619. De Bruijn graph
620. De Bruijn undirected graph
621. Decay number
622. Decidable problem
623. Decision problem
624. Decision problem DIMk
625. Decision tree
626. Decomposable graph
627. Decomposable hammock
628. Decomposable tournament
629. Decomposition
630. Decomposition dimension
631. Defect n-extendable graph
632. Deficiency
633. Deficiency of a bipartite graph
634. Deficiency of a graph
635. Defining set
636. Degenerate tree
637. Degree balanced digraph
638. Degree of a graph
639. Degree of a graph group
640. Degree of a hypergraph edge
641. Degree of an edge
642. Degree pair of a vertex
643. Degree sequence
644. Dense tree
645. Density
646. Dependent set of a matroid
647. Depth-first search (DFS)
648. Depth-first search tree
649. Depth-first spanning forest
650. Depth-first spanning tree
651. Depth of a DAG
652. Depth of a numbering
653. Depth of a tree
654. Depth of a vertex
655. Depth of an arrangeable graph
656. Depth of an arrangement
657. Derivation
658. Derivation tree
659. Derived sequence
660. Descendance graph
661. Descendant
662. Descendant of a vertex
663. Descendent of a vertex
664. Deterministic Turing machine
665. Deterministic automaton
666. Deterministic pushdown automaton
667. Detour
668. Detour center
669. Detour diameter
670. Detour distance
671. Detour dominating set
672. Detour eccentricity
673. Detour order
674. Detour periphery
675. Detour radius
676. Diagonal of a block
677. Diameter
678. Diametral chain
679. Diamond
680. Difference digraph
681. Difference of graphs
682. Differential of a graph
683. Differential of a set
684. Digraph
685. Dijkstra's algorithm
686. Dimension of a poset
687. Dinitz's algorithm
688. Direct product
689. Direct search
690. Directable graph
691. Directed acyclic graph
692. Directed edge
693. Directed forest
694. Directed graph
695. Directed hypergraph
696. Directed hyperpath
697. Directed hypertree
698. Directed multigraph
699. Directed sequence
700. Diregular digraph
701. Dirichlet eigenvalue problem
702. Disc
703. Disconnected graph
704. Discrete matroid
705. Disjunct union of graphs
706. Dismantlable graph
707. Dismantling enumeration
708. Dismantling order
709. Disorientation of an arc
710. Dissection
711. Distance
712. Distance-hereditary graph
713. Distance-transitive graph
714. Distance between two vertices
715. Divider
716. Domatic number
717. Domatic partition
718. Domatically full graph
719. Dominance number
720. Dominant-covering graph
721. Dominant-matching graph
722. Dominant set
723. Dominating cycle
724. Dominating function
725. Dominating graph
726. Dominating path
727. Dominating set
728. Dominating vertex
729. Dominating walk
730. Domination graph
731. Domination graph (of a tournament)
732. Domination number
733. Domination number relative to v
734. Domination perfect graph
735. Domination subdivision number
736. Dominator
737. Dominator tree
738. Domino
739. Domsaturation number
740. Double competition number
741. Double dominating set
742. Double domination number
743. Double edge dominating set
744. Double edge domination number
745. Double ray
746. Double rotation
747. Double star
748. Doubly chordal graph
749. Doubly perfect ordering
750. Doubly regular tournament
751. Doubly simplicial vertex
752. Doubly stochastic matrix
753. Dual graph
754. Dual hypergraph
755. Dual hypertree
756. Dual map
757. Dual matroid
758. Dual tournament
759. Dually chordal graph
760. Dually compact closed class of graphs
761. Dudeney's round table problem
762. Dudeney set
763. E-Free grammar
764. E-Free сoncatenation closure
765. E-Правило
766. E k-Cordial graph
767. Eccentric graph
768. Eccentric sequence
769. Eccentricity of a vertex
770. Economy region
771. Edge
772. Edge-cordial graph
773. Edge-cordial labeling
774. Edge-cover
775. Edge-critical graph
776. Edge-degree
777. Edge-forwarding index
778. Edge-graceful graph
779. Edge-graceful labeling
780. Edge-independent number
781. Edge-integrity
782. Edge-isoperimetric problem
783. Edge-labeling
784. Edge-magic total graph
785. Edge-magic total labeling
786. Edge-ordering
787. Edge-pancyclic graph
788. Edge-pancyclicity
789. Edge-ranking of a graph
790. Edge-superconnectivity
791. Edge adding
792. Edge chromatic number
793. Edge clique cover
794. Edge clique cover number
795. Edge colourable graph
796. Edge connectivity
797. Edge connectivity number
798. Edge core
799. Edge covering
800. Edge critical graph
801. Edge cut, edge cut set
802. Edge density
803. Edge dominating set
804. Edge domination number
805. Edge graph
806. Edge group of a graph
807. Edge incidency matrix
808. Edge isomorphic graphs
809. Edge k-colourable graph
810. Edge k-colouring
811. Edge kernel
812. Edge list
813. Edge monochromatic class
814. Edge of a hypergraph
815. Edge of attachment
816. Edge path cover
817. Edge path number
818. Edge ranking number
819. Edge reconstructibility
820. Edge regular graph
821. Edge space
822. Edge symmetric graph
823. Edge t-ranking
824. Effectively solvable problem
825. Efficient dominating set
826. Eigenvalue of a graph
827. Element of a graph
828. Elementary Petri net
829. Elementary homomorphism
830. Embedding of a graph
831. Emptiness problem
832. Empty deadend
833. Empty deadlok
834. Empty graph
835. Empty hypergraph
836. Empty loop
837. Empty marking problem
838. Empty problem
839. Empty string
840. Empty subgraph
841. Empty symbol
842. Empty tree
843. Enabled transition
844. Enclosure transition
845. End-edge
846. Endblock
847. Endline graph
848. Endomorphism
849. Endpoint, end-vertex
850. Endpoints of a path (chain)
851. Energy of graph
852. Entire choice number
853. Entire chromatic number
854. Entire colouring
855. Entry
856. Entry node of a fragment
857. Entry vertex
858. Entry vertex of a subgraph
859. Environment of a vertex
860. Equally coloured vertices
861. Equiseparable trees
862. Equistable graph
863. Equitable partition
864. Equivalence of languages problem
865. Equivalence problem
866. Equivalence relation
867. Equivalent cycles
868. Equivalent derivations
869. Equivalent grammars
870. Equivalent program schemata
871. Equivalent programs
872. Erdos--Gallai criterion
873. Essential arc
874. Essential independent set
875. Euler's formula
876. Euler graph
877. Eulerian chain
878. Eulerian circuit
879. Eulerian cycle
880. Eulerian digraph
881. Eulerian graph
882. Eulerian tour
883. Eulerian trail
884. Evaluated graph
885. Evaluation of a graph
886. Even component
887. Even contractile graph
888. Even graph
889. Even pair
890. Event
891. Event-condition system
892. Event condition
893. Event realization
894. Exact double dominating set
895. Exact n-step dominating set
896. Exact n-step domination graph
897. Exceptional graph
898. Exclusion operation
899. Execution of Petri net
900. Execution of large-block schema
901. Execution sequence
902. Exhaustive search
903. Exit
904. Exit node of a fragment
905. Exponent of a digraph
906. Expression DAG
907. Expression dag
908. Extended odd graph
909. Extended regular expression
910. Exterior face
911. Exterior of a cycle
912. External input place
913. External output place
914. External place
915. External stability set
916. F-Arc
917. F-Direct arc
918. F-Dominating cycle
919. F-Factor
920. F-Heap
921. F-Inverse arc
922. F-Line
923. F-Matching width
924. F-Orthogonal subgraph
925. F-Path
926. F-Rank
927. F-Ray
928. F-Reachable (from p) node
929. F-Region
930. F-Stability number
931. F-Stable set
932. F-Width (of a hypergraph)
933. F-Достижимость
934. F-Дуга
935. F-Линия
936. F-Луч
937. F-Область
938. F-Прямая дуга
939. F-Путь
940. F-Ранг
941. F-Фактор
942. FAS-problem
943. FVS-problem
944. Face
945. Facet
946. Facial cycle
947. Factor-cf-graph
948. Factor-critical graph
949. Factor-graph
950. Factorization
951. Factorization of a graph
952. Father of a vertex
953. Feedback arc set
954. Feedback vertex set
955. Fibonacci heap
956. Fibre
957. Filter
958. Final substring
959. Finish vertex
960. Finishing node of fragment
961. Finite automaton
962. Finite graph
963. Finite tree
964. Finiteness problem
965. First Order formula
966. Five-color theorem
967. Fixed vertex
968. Flag
969. Flat forest
970. Flow
971. Flow-diagram
972. Flow-equivalent graphs
973. Flow augmenting path
974. Flow control
975. Flow dependence
976. Flower
977. Forbidden subgraph
978. Forcing number
979. Forcing set
980. Ford-Fulkerson's theorem
981. Forest-perfect graph
982. Forest graph
983. Formal language
984. Formal language theory
985. Forward arc
986. Foundtion of G-trade
987. Fractional-chromatic number
988. Fractional-coloring
989. Fractional clique number
990. Fractional k-factor
991. Fractional matching
992. Fractional matching number
993. Fragment
994. Frame
995. Framing number
996. Fraternal orientation
997. Fraternally orientable digraph
998. Fraternally oriented digraph
999. Free-choice Petri net
1000. Free Petri net
1001. Free language
1002. Free tree
1003. Frequency-ordered binary search tree
1004. Fully disconnected graph
1005. Functional directed graph
1006. Functional vertex
1007. Functionally equivalent program schemata
1008. Functionally equivalent programs
1009. Fundamental circuit
1010. Fundamental cutset matrix
1011. Fundamental cycle matrix
1012. Fundamental set of circuits
1013. Fundamental set of cutsets
1014. G-Matching function
1015. G-Trade
1016. G-Vertex regular graph
1017. G-Отображающая функция
1018. Game-chromatic number
1019. Game domination number
1020. Gamma-Finite graph
1021. Gamma-Restricted graph
1022. Gamma^-1-Finite graph
1023. Gamma t(G)-Excellent graph
1024. Gem
1025. General graph
1026. General phrase-structure grammar
1027. Generalized Kautz digraph
1028. Generalized Petersen graph
1029. Generalized binary split tree
1030. Generalized competition graph
1031. Generalized de Bruijn graph
1032. Generalized interval order
1033. Generalized semiorder
1034. Generating function
1035. Genus of a graph
1036. Geodesically convex set of vertices
1037. Geodetic chain
1038. Geodetic graph
1039. Geometric dual graph
1040. Geometric realization of graph
1041. Girth
1042. Global density
1043. Global forcing number
1044. Global forcing set
1045. Global irregularity of a digraph
1046. Global strong alliance number
1047. Global w-density
1048. Gossip graph
1049. Gossiping problem
1050. Graceful graph
1051. Graft
1052. Grammar of type 0
1053. Grammar rule
1054. Graph, undirected graph, nonoriented graph
1055. Graph Clustering Problem
1056. Graph Minor Theorem
1057. Graph automorphism group
1058. Graph bundle
1059. Graph capacity
1060. Graph circuit space
1061. Graph cutset space
1062. Graph enumeration
1063. Graph grammar
1064. Graph isomorphism
1065. Graph labeling
1066. Graph morphism
1067. Graph of a partial order
1068. Graph of a strict partial order
1069. Graph of finite automata
1070. Graph of function
1071. Graph of reachable markings
1072. Graph representation
1073. Graph rewriting system (with priorities)
1074. Graph spectral theory
1075. Graph symmetry number
1076. Graph transformation rule
1077. Graph union
1078. Graph with boundary
1079. Graphic sequence of numbers
1080. Graphical (graphic) matroid
1081. Graphical partition of a number
1082. Graphical sequence of numbers
1083. Graphical trade
1084. Graphoid
1085. Graphs union
1086. Greedy algorithm
1087. Grid graph
1088. Group graph
1089. Group of a directed graph
1090. Growing tree
1091. Grundy colouring
1092. Grundy number
1093. Gupta scheme
1094. H-Connected graphs
1095. H-Covering, H-Covering set
1096. H-Saturated graph
1097. H-Tree
1098. H-Uniform hypergraph
1099. H-adjacent graphs
1100. H-decomposition number