bounded degree
Property Testing for Bounded Degree Databases
... the bounded-degree model for property-testing of graphs, introduced by Goldreich and Ron [15], and the bidirectional model for directed graphs of [3, ...of bounded degree over a fixed finite ...
14
Inapproximability of Vertex Cover and Independent Set in Bounded Degree Graphs
... unbounded degree), it is a notoriously difficult problem even to approximate the solutions to these problems, and there is strong evidence that indeed no good approximation is ...whose degree is ...
17
Every testable (infinite) property of bounded-degree graphs contains an infinite hyperfinite subproperty
... the bounded-degree graph model is either finite or contains an infinite hyperfinite ...in bounded-degree ...of bounded-degree graphs into sets of vertices such that the ...
14
Approximation Algorithms for Complex-Valued Ising Models on Bounded Degree Graphs
... on bounded degree graphs based on the decay of correlations prop- ...maximum degree at most ∆ when the interac- tions and external fields lie in the uniqueness region of the Gibbs measure on the ...
12
Relating two property testing models for bounded degree directed graphs
... for bounded degree digraphs by showing that every constant-query testable property in the bidirec- tional model that allows both incoming and outgoing neigh- bor queries can be tested in sublinear query ...
14
Ramsey goodness of bounded degree trees
... of bounded degree trees, it is natural to consider whether trees are Ramsey good for all graphs ...has bounded degree?” Erd˝os, Faudree, Rousseau and Schelp [8, 9, 10] wrote several papers on ...
20
Testing hereditary properties of nonexpanding bounded degree graphs
... for bounded-degree graphs in time independent of the input ...the bounded-degree graph model (where two graphs are considered “far” if they differ in εn edges for a positive constant ε ), many ...
13
Optimal packings of bounded degree trees
... A related result of [23] guarantees a near-optimal packing of a collection of bounded degree graphs (which are allowed to be spanning) into quasi-random graphs. As indicated earlier, the results in [23] are ...
57
Polynomial Identities on Algebras with Actions
... An algebra will sometimes admit a natural vector space decomposition that is not a group- grading (or even a set-grading), but can nevertheless be used to determine important prop- erties of the algebra. In this chapter, ...
98
DAG Automata for Meaning Representation
... Another question is whether there should be an order on the incoming and outgoing edges of a ver- tex. Standard edge labels such as arg0, arg1, etc seem to indicate an order on outgoing edges. However, there can also be ...
12
Development of Interest in Science and Interest in Teaching Elementary Science: Influence of Informal, School, and Inquiry Methods Course Experiences
... The tools that are used to prove this result are the Szemerédi Regularity Lemma and the Blow Up Lemma. A full proof of the Regularity Lemma is given. The Blow-Up Lemma is merely stated, but other graph embedding results ...
51
The distribution of Mahler's measures of reciprocal polynomials
... We study the distribution of Mahler’s measures of reciprocal polynomials with complex co- efficients and bounded even degree. We discover that the distribution function associated to Mahler’s measure ...
14
High-Dimensional Gaussian Graphical Model Selection: Walk Summability and Local Separation Criterion
... on bounded-degree graphs, based on a series of conditional- independence ...maximum degree in the graph to be bounded (∆ = O(1)) which is ...maximum degree can grow with the number of ...
45
On the stable degree of graphs
... stable degree is hard to compute in general, but if we restrict the input to AT-free graphs, or even graphs of bounded asteroidal number, then the stable degree can be computed by a polynomial time ...
13
Bounded Sum and Bounded Product of Fuzzy Matrices
... product, bounded sum, bounded product, max-min composition and so ...operators. Bounded sum and bounded product of fuzzy matrices are introduced by Zhang and Zheng [28] and presented several ...
11
Index Formulas for Countably φ−Set Contraction
... Proof. Suppose that µ is not a characteristic value of L. Then I − µL is injective. From µ n ≤ k −1 it follows by Proposition 2.8 that I − µL is Fredholm of index zero. Hence codimR(I − µL) = dimN(I − µL) = 0 and so R(I ...
10
An Arakelov-theoretic approach to naïve heights on hyperelliptic Jacobians
... 1.1. Previous explicit computational work on N´ eron-Tate heights. The N´ eron-Tate height was defined by N´ eron [N´ er65]. The problems of computing the height of a given point on the Jacobian of a curve and com- ...
24
Dürre, Florian Maximilian (2009): Self-organized critical phenomena: Forest fire and sandpile models. Dissertation, LMU München: Fakultät für Mathematik, Informatik und Statistik
... It is known that innite volume forest re processes exist for all ignition rates λ > 0. The proof of existence is rather abstract, and does not imply uniqueness. Nor does the construction answer the question whether ...
111
Dependency Parsing with Bounded Block Degree and Well nestedness via Lagrangian Relaxation and Branch and Bound
... We consider arc-factored dependency parsing with well-nestedness and bounded block degree constraints. We formulate this problem as an In- teger Linear Program (ILP) and apply Lagrangian Relaxation where ...
12
Theoretically optimal datalog rewritings for OWL 2 QL ontology mediated queries
... of bounded depth and conjunctive queries of bounded treewidth, (ii) on- tologies of bounded depth and bounded-leaf tree-shaped conjunctive queries, and (iii) arbitrary ontologies and ...
25