Sentence examples for graphs and for from inspiring English sources

We prove that the F3-domination problem is NP-complete for bipartite planar graphs and for chordal graphs.

In this paper, we prove tight bounds for 2-connected graphs and for 2-edge-connected graphs.

offline algorithms for discovering access constraints from real-life graphs and for maintaining the constraints in response to changes to the graphs; and.

In particular, when available, we present bounds by which it is possible to relate performance and topology for general graphs, for graphs with symmetries, called Cayley graphs, and for geometric graphs.

This yields to optimal label length schemes for the family of distance-hereditary graphs and for other families of graphs, allowing distance estimation in constant time once the labels have been constructed.

(mathsf {RESOURCE}) can be built on top of existing graph query engines provided with the following algorithms: 1. offline algorithms for discovering access constraints from real-life graphs and for maintaining the constraints in response to changes to the graphs; and   2.

For example, Levinson's formula for star graphs and expressions for the spectral shift function and perturbation determinant for star graphs were proved in [3].

We achieve the deviation Δ="1 for interval graphs and Δ= 2 for chordal bipartite and homogeneously orderable graphs.

The authors thank Mr. Don Poulsen for his help with the graphs and figures for this manuscript.

Algorithms are presented for efficiently obtaining least generalizations of schemata, for adding new schemata to a schema-hierarchy graph, and for using schemata to construct new programs.

GraphPad Prism was used for generation of graphs and figures and for statistical analyses (GraphPad Software, La Jolla, CA).