Results 1  10
of
281,530
Resource Allocation in Bounded Degree Trees
, 2007
"... We study the bandwidth allocation problem (bap) in bounded degree trees. In this problem we are given a tree and a set of connection requests. Each request consists of a path in the tree, a bandwidth requirement, and a weight. Our goal is to find a maximum weight subset S of requests such that, for ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
We study the bandwidth allocation problem (bap) in bounded degree trees. In this problem we are given a tree and a set of connection requests. Each request consists of a path in the tree, a bandwidth requirement, and a weight. Our goal is to find a maximum weight subset S of requests such that
Fractional Coloring of Bounded Degree Trees
, 2001
"... We study the dipathcoloring problem in bounded degree and treewidth symmetric digraphs, in which one needs to color the dipaths with a minimum number of colors, in such a way that dipaths using the same arc have different colors. This classic combinatorial problem finds applications in the minimiza ..."
Abstract
 Add to MetaCart
We study the dipathcoloring problem in bounded degree and treewidth symmetric digraphs, in which one needs to color the dipaths with a minimum number of colors, in such a way that dipaths using the same arc have different colors. This classic combinatorial problem finds applications
Universal graphs for boundeddegree trees and planar graphs
 SIAM J. Disc. Math
, 1989
"... Abstract. How small can a graph be that contains as subgraphs all trees on n vertices with maximum degree d? In this paper, this question is answered by constructing such universal graphs that have n vertices and bounded degree (depending only on d). Universal graphs with n vertices and O(n log n) e ..."
Abstract

Cited by 24 (2 self)
 Add to MetaCart
Abstract. How small can a graph be that contains as subgraphs all trees on n vertices with maximum degree d? In this paper, this question is answered by constructing such universal graphs that have n vertices and bounded degree (depending only on d). Universal graphs with n vertices and O(n log n
Large bounded degree trees in expanding graphs
"... A remarkable result of Friedman and Pippenger [4] gives a sufficient condition on the expansion properties of a graph to contain all small trees with bounded maximum degree. Haxell [5] showed that under slightly stronger assumptions on the expansion rate, their technique allows one to find arbitrari ..."
Abstract

Cited by 12 (4 self)
 Add to MetaCart
A remarkable result of Friedman and Pippenger [4] gives a sufficient condition on the expansion properties of a graph to contain all small trees with bounded maximum degree. Haxell [5] showed that under slightly stronger assumptions on the expansion rate, their technique allows one to find
Fractional Path Coloring in Bounded Degree Trees with Applications∗
, 2009
"... HAL is a multidisciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte p ..."
Abstract
 Add to MetaCart
HAL is a multidisciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et a ̀ la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignement et de recherche français ou étrangers, des laboratoires publics ou privés.
The Glauber dynamics for colourings of bounded degree trees
, 2008
"... We study the Glauber dynamics Markov chain for kcolourings of trees with maximum degree ∆. For k ≥ 3, we show that the mixing time on every tree is at most n O(1+∆/(k log ∆)). This bound is tight up to the constant factor in the exponent, as evidenced by the complete tree. Our proof uses a weighted ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
We study the Glauber dynamics Markov chain for kcolourings of trees with maximum degree ∆. For k ≥ 3, we show that the mixing time on every tree is at most n O(1+∆/(k log ∆)). This bound is tight up to the constant factor in the exponent, as evidenced by the complete tree. Our proof uses a
Solving the maximum agreement subtree and the maximum compatible tree problems on many bounded degree trees
 Proceedings of the 17th Annual Symposium on Combinatorial Pattern Matching (CPM’06
, 2006
"... Given a set of leaflabeled trees with identical leaf sets, the wellknown Maximum Agreement SubTree problem (MAST) consists of finding a subtree homeomorphically included in all input trees and with the largest number of leaves. Its variant called Maximum Compatible Tree (MCT) is less stringent, as ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
, as it allows the input trees to be refined. Both problems are of particular interest in computational biology, where trees encountered have often small degrees. In this paper, we study the parameterized complexity of MAST and MCT with respect to the maximum degree, denoted by D, of the input trees. Although
BoundedDegree Spanning Tree Problems
"... Given a connected graph G a vertex is said to be branch if its degree is greater than 2. We consider two problems arising in the context of optical networks: (i) finding a spanning tree of G with the minimum number of branch vertices and (ii) finding a spanning tree of G such that the degree sum of ..."
Abstract
 Add to MetaCart
Given a connected graph G a vertex is said to be branch if its degree is greater than 2. We consider two problems arising in the context of optical networks: (i) finding a spanning tree of G with the minimum number of branch vertices and (ii) finding a spanning tree of G such that the degree sum
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
Results 1  10
of
281,530