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

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

451. Complete coloring
452. Complete colouring
453. Complete directed graph
454. Complete graph
455. Complete homomorphism of order n
456. Complete k-partite graph
457. Complete k-uniform hypergraph
458. Complete multipartite graph
459. Complete product
460. Complete rotation
461. Complete set of graph invariants
462. Complete system of equivalent transformations
463. Complete tree
464. Completed Husimi tree
465. Completely triangular graph
466. Complex windmill
467. Complexity of RAM
468. Complexity theory
469. Component design method
470. Component index
471. Component number
472. Component of a graph
473. Composite hammock
474. Composition of graphs
475. Compound dependency graph
476. Compound graph
477. Computation
478. Concatenation
479. Concatenation closure
480. Concepts Path Graph
481. Conceptual graph
482. Condensation
483. Conditional connectivity
484. Cone over a graph
485. Conflict
486. Confluent NCE graph grammar
487. Conformal hypergraph
488. Conjunction of graphs
489. Connected component
490. Connected component of a hypergraph
491. Connected dominating set
492. Connected domination number
493. Connected graph
494. Connected hierarchical graph
495. Connected hypergraph
496. Connected set of vertices
497. Connected to relation
498. Connected vertices
499. Connective index
500. Connectivity
501. Connectivity axioms
502. Connectivity function
503. Connectivity matrix
504. Consecutive adjacent graph
505. Consecutive labeling
506. Constructible graph
507. Constructing enumeration
508. Constructing order
509. Containment graph
510. Context-free grammar
511. Context-free language
512. Context-sensitive grammar
513. Context-sensitive language
514. Contrabasis
515. Contractable edge
516. Contracted visibility graph
517. Contracting edge, contraction of an edge
518. Contraction of a graph
519. Contraction of an even pair
520. Contrafunctional graph
521. Control dependence
522. Converse digraph
523. Convex bipartite graph
524. Convex dominating set
525. Convex domination number
526. Convex linear graph
527. Convex set in G
528. Coordinated graph
529. Corank function of a matroid
530. Core
531. Corona
532. Cospectral graphs
533. Cotree, co-tree
534. Countable graph
535. Counter automation
536. Coverability tree
537. Covering cycle
538. Covering graph
539. Covering set of vertices
540. Covering vertex set
541. Critical edge
542. Critical graph
543. Critical kernel-imperfect digraph
544. Critical pair
545. Critical path
546. Critical path method
547. Critical set
548. Critical tournament
549. Critical vertex
550. Criticality index
551. Critically k-connected graph
552. Cross
553. Cross-adjacent edges
554. Cross-chromatic index
555. Cross-free coloring
556. Cross-free matching
557. Cross-free matching number
558. Cross arc
559. Cross product
560. Crossing number
561. Crown
562. Crown of graphs
563. Cubic graph
564. Cubical graph
565. Cut-edge
566. Cut-vertex
567. Cut of a layout
568. Cutpoint
569. Cutpoint graph
570. Cutset
571. Cutset matrix
572. Cutset matroid
573. Cutting set
574. Cutting vertex
575. Cutvertex
576. Cutwidth of a graph
577. Cutwidth of a layout
578. Cyclability
579. Cycle
580. Cycle-factor
581. Cycle basis
582. Cycle complementary
583. Cycle cover problem
584. Cycle embedding matrix
585. Cycle isomorphism
586. Cycle matrix
587. Cycle matroid
588. Cycle space
589. Cycle spectrum
590. Cycle vector
591. Cyclic alternating chain
592. Cyclic chromatic number
593. Cyclic edge
594. Cyclic edge connected vertices
595. Cyclic graph
596. Cyclic matroid
597. Cyclic sequence
598. Cyclic vector of a graph
599. Cyclomatic complexity of a program
600. Cyclomatic matrix
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