40,924 research outputs found
Parameterized Algorithms for Directed Maximum Leaf Problems
We prove that finding a rooted subtree with at least leaves in a digraph
is a fixed parameter tractable problem. A similar result holds for finding
rooted spanning trees with many leaves in digraphs from a wide family
that includes all strong and acyclic digraphs. This settles completely an open
question of Fellows and solves another one for digraphs in . Our
algorithms are based on the following combinatorial result which can be viewed
as a generalization of many results for a `spanning tree with many leaves' in
the undirected case, and which is interesting on its own: If a digraph of order with minimum in-degree at least 3 contains a rooted
spanning tree, then contains one with at least leaves
Cutwidth: obstructions and algorithmic aspects
Cutwidth is one of the classic layout parameters for graphs. It measures how
well one can order the vertices of a graph in a linear manner, so that the
maximum number of edges between any prefix and its complement suffix is
minimized. As graphs of cutwidth at most are closed under taking
immersions, the results of Robertson and Seymour imply that there is a finite
list of minimal immersion obstructions for admitting a cut layout of width at
most . We prove that every minimal immersion obstruction for cutwidth at
most has size at most .
As an interesting algorithmic byproduct, we design a new fixed-parameter
algorithm for computing the cutwidth of a graph that runs in time , where is the optimum width and is the number of vertices.
While being slower by a -factor in the exponent than the fastest known
algorithm, given by Thilikos, Bodlaender, and Serna in [Cutwidth I: A linear
time fixed parameter algorithm, J. Algorithms, 56(1):1--24, 2005] and [Cutwidth
II: Algorithms for partial -trees of bounded degree, J. Algorithms,
56(1):25--49, 2005], our algorithm has the advantage of being simpler and
self-contained; arguably, it explains better the combinatorics of optimum-width
layouts
Largest Laplacian Eigenvalue and Degree Sequences of Trees
We investigate the structure of trees that have greatest maximum eigenvalue
among all trees with a given degree sequence. We show that in such an extremal
tree the degree sequence is non-increasing with respect to an ordering of the
vertices that is obtained by breadth-first search. This structure is uniquely
determined up to isomorphism. We also show that the maximum eigenvalue in such
classes of trees is strictly monotone with respect to majorization.Comment: 9 pages, 2 figure
An Even Faster and More Unifying Algorithm for Comparing Trees via Unbalanced Bipartite Matchings
A widely used method for determining the similarity of two labeled trees is
to compute a maximum agreement subtree of the two trees. Previous work on this
similarity measure is only concerned with the comparison of labeled trees of
two special kinds, namely, uniformly labeled trees (i.e., trees with all their
nodes labeled by the same symbol) and evolutionary trees (i.e., leaf-labeled
trees with distinct symbols for distinct leaves). This paper presents an
algorithm for comparing trees that are labeled in an arbitrary manner. In
addition to this generality, this algorithm is faster than the previous
algorithms.
Another contribution of this paper is on maximum weight bipartite matchings.
We show how to speed up the best known matching algorithms when the input
graphs are node-unbalanced or weight-unbalanced. Based on these enhancements,
we obtain an efficient algorithm for a new matching problem called the
hierarchical bipartite matching problem, which is at the core of our maximum
agreement subtree algorithm.Comment: To appear in Journal of Algorithm
Character of Trees with Extreme Balaban Index
NSFC [10831001]The Balaban index (also called J index) of a connected graph G is defined as J = J(G) = vertical bar E(G)vertical bar/mu+1 Sigma u upsilon is an element of E(G) 1/root sigma(G)(u)sigma(G)(upsilon), where sigma(G)(u) = Sigma omega is an element of V(G)D(G)(u, w) and mu is the cyclomatic number. Balaban index has been used in various QSAR and QSPR studies. In this paper, we characterize the trees with the maximum Balaban index among all the trees with a vertices and either the maximum degree A, or a given degree sequence, or k pendent vertices. In addition, the tree with the minimum Balaban index and a vertices and the maximum degree A, and the tree with the maximum Balaban index and a vertices and the maxinjuin degree A and k pendent vertices are also determined. On the other hand, we find that a lemma without proof in our paper [MATCH Commu. Math. Commit. Chem. 63 (2010) 799-812] is incorrect, and so are several related theorems. In the appendix of this paper, we rework the lemma and theorems, and give a new character for the graph with maximum Balaban index among graphs with n vertices. Several open problems on graphs with extreme Balaban indices are proposed
Bounding Embeddings of VC Classes into Maximum Classes
One of the earliest conjectures in computational learning theory-the Sample
Compression conjecture-asserts that concept classes (equivalently set systems)
admit compression schemes of size linear in their VC dimension. To-date this
statement is known to be true for maximum classes---those that possess maximum
cardinality for their VC dimension. The most promising approach to positively
resolving the conjecture is by embedding general VC classes into maximum
classes without super-linear increase to their VC dimensions, as such
embeddings would extend the known compression schemes to all VC classes. We
show that maximum classes can be characterised by a local-connectivity property
of the graph obtained by viewing the class as a cubical complex. This geometric
characterisation of maximum VC classes is applied to prove a negative embedding
result which demonstrates VC-d classes that cannot be embedded in any maximum
class of VC dimension lower than 2d. On the other hand, we show that every VC-d
class C embeds in a VC-(d+D) maximum class where D is the deficiency of C,
i.e., the difference between the cardinalities of a maximum VC-d class and of
C. For VC-2 classes in binary n-cubes for 4 <= n <= 6, we give best possible
results on embedding into maximum classes. For some special classes of Boolean
functions, relationships with maximum classes are investigated. Finally we give
a general recursive procedure for embedding VC-d classes into VC-(d+k) maximum
classes for smallest k.Comment: 22 pages, 2 figure
Rearranging trees for robust consensus
In this paper, we use the H2 norm associated with a communication graph to
characterize the robustness of consensus to noise. In particular, we restrict
our attention to trees and by systematic attention to the effect of local
changes in topology, we derive a partial ordering for undirected trees
according to the H2 norm. Our approach for undirected trees provides a
constructive method for deriving an ordering for directed trees. Further, our
approach suggests a decentralized manner in which trees can be rearranged in
order to improve their robustness.Comment: Submitted to CDC 201
- …