Find link

language:

Find link is a tool written by Edward Betts.

Longer titles found: Closed graph property (view)

searching for Graph property 29 found (47 total)

Property testing (2,454 words) [view diff] exact match in snippet view article find links to article

notions of property testing in the context of graphs, we say a tester for graph property P should distinguish with at least two-thirds probability between the

Graph minor (4,046 words) [view diff] exact match in snippet view article find links to article

together with the forbidden minor characterization this implies that every graph property preserved by deletions and contractions may be recognized in polynomial

Structural cut-off (975 words) [view diff] exact match in snippet view article find links to article

finite size network due to structural limitations (such as the simple graph property). Networks with vertices with degree higher than the structural cut-off

Biased graph (1,541 words) [view diff] exact match in snippet view article find links to article

circles; this by definition is a class of circles that satisfies the theta-graph property mentioned above. A subgraph or edge set whose circles are all in B (and

Evasive Boolean function (768 words) [view diff] exact match in snippet view article find links to article

subroutine for testing the adjacency of vertices. In this application, a graph property can be described as a Boolean function whose input variables are true

Implicit graph (2,839 words) [view diff] exact match in snippet view article find links to article

adjacency test, without reference to how the test is implemented. A graph property is the question of whether a graph belongs to a given family of graphs;

Planar cover (2,181 words) [view diff] exact match in snippet view article find links to article

with planar covers. The existence of a planar cover is a minor-closed graph property, and so can be characterized by finitely many forbidden minors, but

Gil Kalai (729 words) [view diff] exact match in snippet view article find links to article

1992), pp. 475–482. Friedgut, Ehud; Kalai, Gil (1996), "Every monotone graph property has a sharp threshold", Proceedings of the American Mathematical Society

Entropy influence conjecture (230 words) [view diff] exact match in snippet view article find links to article

Boolean functions Friedgut, Ehud; Kalai, Gil (1996). "Every monotone graph property has a sharp threshold". Proceedings of the American Mathematical Society

Random graph (2,328 words) [view diff] exact match in snippet view article find links to article

not necessarily the number of edges M, but whatever other arbitrary graph property P ( G ) {\displaystyle {\mathcal {P}}(G)} . In this case very few analytical

Distance-regular graph (969 words) [view diff] exact match in snippet view article find links to article

Graph property

Set-valued function (915 words) [view diff] exact match in snippet view article find links to article

distinguish multiple concepts generalizing continuity, such as the closed graph property and upper and lower hemicontinuity. There are also various generalizations

Control-flow graph (1,548 words) [view diff] exact match in snippet view article find links to article

has edges from A to B, A to C, B to D and C to D. Reachability is a graph property useful in optimization. If a subgraph is not connected from the subgraph

Danny Cohen (computer scientist) (1,515 words) [view diff] exact match in snippet view article

the Wayback Machine US Patent 7,561,584 (2009) Implementation of a graph property in a switching fabric for fast networking US Patent 7,525,199 (2009)

Molecule mining (1,742 words) [view diff] no match in snippet view article find links to article

B. Kireev (1995). "ChemNet: A Novel Neural Network Based Method for Graph/Property Mapping". J. Chem. Inf. Comput. Sci. 35 (2): 175–180. doi:10.1021/ci00024a001

Erdős–Rényi model (2,795 words) [view diff] exact match in snippet view article find links to article

behavior. This is formalized in a result of Łuczak. Suppose that P is a graph property such that for every sequence M = M(n) with | M − ( n 2 ) p | = O ( s

String graph (1,183 words) [view diff] exact match in snippet view article find links to article

edges. For graph minors, the Robertson–Seymour theorem states that any graph property closed under minors has finitely many minimal forbidden minors. However

K-outerplanar graph (564 words) [view diff] exact match in snippet view article find links to article

conjectured converse of Courcelle's theorem, according to which every graph property recognizable on graphs of bounded treewidth by finite state tree automata

Jean-François Mertens (3,861 words) [view diff] exact match in snippet view article find links to article

profile as well. Finally the Continuity axiom is basically a closed graph property taking the strongest possible convergence for preference profiles. The

Sexual dimorphism (13,008 words) [view diff] exact match in snippet view article find links to article

parameters (e.g., minimum bipartition width, edge number, the expander graph property, minimum vertex cover), the structural connectome of women are significantly

Colin de Verdière graph invariant (1,089 words) [view diff] exact match in snippet view article find links to article

Graph property

Analysis of Boolean functions (5,379 words) [view diff] exact match in snippet view article find links to article

threshold theorem states, roughly speaking, that a monotone graph property (a graph property is a property which doesn't depend on the names of the vertices)

Universal vertex (1,942 words) [view diff] exact match in snippet view article find links to article

property, using ( n 2 ) {\displaystyle {\tbinom {n}{2}}} queries. A graph property is evasive if no algorithm can test the property guaranteeing fewer

Treewidth (4,569 words) [view diff] exact match in snippet view article find links to article

closely related to the algorithmic theory of bidimensionality, and every graph property definable in first order logic can be decided for an apex-minor-free

Szemerédi regularity lemma (6,164 words) [view diff] exact match in snippet view article find links to article

random partitions Alon, Noga; Shapira, Asaf (2008), "Every monotone graph property is testable", SIAM J. Comput., 38 (2): 505–522, doi:10.1137/050633445

Yao's principle (3,834 words) [view diff] exact match in snippet view article find links to article

conjectured that every randomized algorithm for every nontrivial monotone graph property (a property that remains true for every subgraph of a graph with the

Ashish Goel (981 words) [view diff] exact match in snippet view article find links to article

(i.e. without looking at all the edges); showing that every monotone graph property has a sharp threshold in geometric random graphs; and showing that in

Graph Query Language (4,272 words) [view diff] no match in snippet view article find links to article

Entities are modelled as nodes, and relationships as edges, in a graph. Property graphs are multigraphs: there can be many edges between the same pair

Abstract economy (3,366 words) [view diff] exact match in snippet view article find links to article

of the choice-sets). The following example shows that, when the open graph property does not hold, equilibrium may fail to exist. There is an economy with