dependent subgraph
Смотреть что такое "dependent subgraph" в других словарях:
Pseudoforest — A 1 forest (a maximal pseudoforest), formed by three 1 trees In graph theory, a pseudoforest is an undirected graph[1] in which every connected component has at most one cycle. That is, it is a system of vertices and edges connecting pairs of ve … Wikipedia
Clique percolation method — The clique percolation method[1] is a popular approach for analyzing the overlapping community structure of networks. The term network community (also called a module, cluster or cohesive group) has no widely accepted unique definition and it is… … Wikipedia
Planarity testing — In graph theory, the planarity testing problem asks whether, given a graph, that graph is a planar graph (can be drawn in the plane without edge intersections). This is a well studied problem in computer science for which many practical… … Wikipedia
Simplified molecular input line entry specification — Infobox file format name = smiles extension = .smi mime = owner = creatorcode = genre = chemical file format container for = contained by = extended from = extended to = The simplified molecular input line entry specification or SMILES is a… … Wikipedia
Greedoid — In combinatorics, a greedoid is a type of set system. It arises from the notion of the matroid, which was originally introduced by Whitney in 1935 to study planar graphs and was later used by Edmonds to characterize a class of optimization… … Wikipedia
Partition coefficient — In chemistry and the pharmaceutical sciences, a partition (P) or distribution coefficient (D) is the ratio of concentrations of a compound in the two phases of a mixture of two immiscible solvents at equilibrium.[1] The terms gas/liquid partition … Wikipedia
Neil J. Gunther — Neil James Gunther Neil Gunther at Bletchley Park 2002 A quantum leap is neither Born … Wikipedia
Bicircular matroid — In in the mathematical subject of matroid theory, the bicircular matroid of a graph G is the matroid B ( G ) whose points are the edges of G and whose independent sets are the edge sets of pseudoforests of G , that is, the edge sets in which each … Wikipedia
