Results 1  10
of
8,892
Automatic Structures of Bounded Degree
 In Proceedings of the 10th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR 2003), Almaty (Kazakhstan), number 2850 in Lecture Notes in Artificial Intelligence
, 2003
"... The rstorder theory of an automatic structure is known to be decidable but there are examples of automatic structures with nonelementary rstorder theories. We prove that the rstorder theory of an automatic structure of bounded degree (meaning that the corresponding Gaifmangraph has bounded ..."
Abstract

Cited by 8 (4 self)
 Add to MetaCart
The rstorder theory of an automatic structure is known to be decidable but there are examples of automatic structures with nonelementary rstorder theories. We prove that the rstorder theory of an automatic structure of bounded degree (meaning that the corresponding Gaifmangraph has
Property Testing in Bounded Degree Graphs
 Algorithmica
, 1997
"... We further develop the study of testing graph properties as initiated by Goldreich, Goldwasser and Ron. Whereas they view graphs as represented by their adjacency matrix and measure distance between graphs as a fraction of all possible vertex pairs, we view graphs as represented by boundedlength in ..."
Abstract

Cited by 124 (36 self)
 Add to MetaCart
length incidence lists and measure distance between graphs as a fraction of the maximum possible number of edges. Thus, while the previous model is most appropriate for the study of dense graphs, our model is most appropriate for the study of boundeddegree graphs. In particular, we present randomized algorithms
Circumference of Graphs with Bounded Degree
"... Karger, Motwani and Ramkumar have shown that there is no constant approximation algorithm to find a longest cycle in a Hamiltonian graph, and they conjectured this is the case even for graphs with bounded degree. On the other hand,Feder, Motwani and Subi have shown that there is a polynomial time a ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
Karger, Motwani and Ramkumar have shown that there is no constant approximation algorithm to find a longest cycle in a Hamiltonian graph, and they conjectured this is the case even for graphs with bounded degree. On the other hand,Feder, Motwani and Subi have shown that there is a polynomial time
Bounding Cost Bounding Degrees
, 2010
"... Theorem about individual variable values in LP solution Technique: Solve LP Round some variables ..."
Abstract
 Add to MetaCart
Theorem about individual variable values in LP solution Technique: Solve LP Round some variables
On testing expansion in boundeddegree graphs
 Electronic Colloquium on Computational Complexity (ECCC
, 2000
"... Abstract. We consider testing graph expansion in the boundeddegree graph model. Specifically, we refer to algorithms for testing whether the graph has a second eigenvalue bounded above by a given threshold or is far from any graph with such (or related) property. We present a natural algorithm aime ..."
Abstract

Cited by 67 (5 self)
 Add to MetaCart
Abstract. We consider testing graph expansion in the boundeddegree graph model. Specifically, we refer to algorithms for testing whether the graph has a second eigenvalue bounded above by a given threshold or is far from any graph with such (or related) property. We present a natural algorithm
Labeling Schemes for Bounded Degree Graphs
, 2014
"... We investigate adjacency labeling schemes for graphs of bounded degree ∆ = O(1). In particular, we present an optimal (up to an additive constant) log n+ O(1) adjacency labeling scheme for bounded degree trees. The latter scheme is derived from a labeling scheme for bounded degree outerplanar graph ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We investigate adjacency labeling schemes for graphs of bounded degree ∆ = O(1). In particular, we present an optimal (up to an additive constant) log n+ O(1) adjacency labeling scheme for bounded degree trees. The latter scheme is derived from a labeling scheme for bounded degree outerplanar
Bounded Degree Spanning Trees
, 1997
"... f Garey, Johnson, and Tarjan [GJT76] (it is N P complete to decide, if a 3connected 3regular planar graph has a Hamiltonian path/cycle), and Yannakakis [Yan81] (it is N P complete to decide, if a graph has a connected spanning subgraph of maximum degree r, r 2). To our knowledge there is no res ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
f Garey, Johnson, and Tarjan [GJT76] (it is N P complete to decide, if a 3connected 3regular planar graph has a Hamiltonian path/cycle), and Yannakakis [Yan81] (it is N P complete to decide, if a graph has a connected spanning subgraph of maximum degree r, r 2). To our knowledge
Matching for graphs of bounded degree
 Frontiers in Algorithmics
, 2008
"... Abstract. We show that there exists a matching with 4m 5k+3 edges in a graph of degree k and m edges. ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract. We show that there exists a matching with 4m 5k+3 edges in a graph of degree k and m edges.
Independent Sets in BoundedDegree
"... In this paper we analyze several approaches to the Maximum Independent Set (MIS) problem in hypergraphs with degree bounded by a parameter ∆. Since independent sets in hypergraphs can be strong and weak, we denote by MIS (MSIS) the problem of finding a maximum weak (strong) independent set in hyperg ..."
Abstract
 Add to MetaCart
In this paper we analyze several approaches to the Maximum Independent Set (MIS) problem in hypergraphs with degree bounded by a parameter ∆. Since independent sets in hypergraphs can be strong and weak, we denote by MIS (MSIS) the problem of finding a maximum weak (strong) independent set
Spanning Trees of Bounded Degree
"... Dirac's classic theorem asserts that if G is a graph on n vertices, and #(G) # n/2, then G has a hamilton cycle. As is well known, the proof also shows that if deg(x)+deg(y) # (n  1), for every pair x, y of independent vertices in G, then G has a hamilton path. More generally, S. Win has shown ..."
Abstract
 Add to MetaCart
shown that if k # 2, G is connected and # x#I deg(x) # n  1 whenever I is a kelement independent set, then G has a spanning tree T with #(T) # k. Here we are interested in the structure of spanning trees under the additional assumption that G does not have a spanning tree with maximum degree less than
Results 1  10
of
8,892