447 research outputs found
An FPT Algorithm for Directed Spanning k-Leaf
An out-branching of a directed graph is a rooted spanning tree with all arcs
directed outwards from the root. We consider the problem of deciding whether a
given directed graph D has an out-branching with at least k leaves (Directed
Spanning k-Leaf). We prove that this problem is fixed parameter tractable, when
k is chosen as the parameter. Previously this was only known for restricted
classes of directed graphs.
The main new ingredient in our approach is a lemma that shows that given a
locally optimal out-branching of a directed graph in which every arc is part of
at least one out-branching, either an out-branching with at least k leaves
exists, or a path decomposition with width O(k^3) can be found. This enables a
dynamic programming based algorithm of running time 2^{O(k^3 \log k)} n^{O(1)},
where n=|V(D)|.Comment: 17 pages, 8 figure
The Directed Dominating Set Problem: Generalized Leaf Removal and Belief Propagation
A minimum dominating set for a digraph (directed graph) is a smallest set of
vertices such that each vertex either belongs to this set or has at least one
parent vertex in this set. We solve this hard combinatorial optimization
problem approximately by a local algorithm of generalized leaf removal and by a
message-passing algorithm of belief propagation. These algorithms can construct
near-optimal dominating sets or even exact minimum dominating sets for random
digraphs and also for real-world digraph instances. We further develop a core
percolation theory and a replica-symmetric spin glass theory for this problem.
Our algorithmic and theoretical results may facilitate applications of
dominating sets to various network problems involving directed interactions.Comment: 11 pages, 3 figures in EPS forma
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
Limits of interval orders and semiorders
We study poset limits given by sequences of finite interval orders or, as a
special case, finite semiorders. In the interval order case, we show that every
such limit can be represented by a probability measure on the space of closed
subintervals of [0,1], and we define a subset of such measures that yield a
unique representation. In the semiorder case, we similarly find unique
representations by a class of distribution functions.Comment: 18 page
On the Kernel and Related Problems in Interval Digraphs
Given a digraph , a set is said to be absorbing set
(resp. dominating set) if every vertex in the graph is either in or is an
in-neighbour (resp. out-neighbour) of a vertex in . A set
is said to be an independent set if no two vertices in are adjacent in .
A kernel (resp. solution) of is an independent and absorbing (resp.
dominating) set in . We explore the algorithmic complexity of these problems
in the well known class of interval digraphs. A digraph is an interval
digraph if a pair of intervals can be assigned to each vertex
of such that if and only if .
Many different subclasses of interval digraphs have been defined and studied in
the literature by restricting the kinds of pairs of intervals that can be
assigned to the vertices. We observe that several of these classes, like
interval catch digraphs, interval nest digraphs, adjusted interval digraphs and
chronological interval digraphs, are subclasses of the more general class of
reflexive interval digraphs -- which arise when we require that the two
intervals assigned to a vertex have to intersect. We show that all the problems
mentioned above are efficiently solvable, in most of the cases even linear-time
solvable, in the class of reflexive interval digraphs, but are APX-hard on even
the very restricted class of interval digraphs called point-point digraphs,
where the two intervals assigned to each vertex are required to be degenerate,
i.e. they consist of a single point each. The results we obtain improve and
generalize several existing algorithms and structural results for subclasses of
reflexive interval digraphs.Comment: 26 pages, 3 figure
Data optimizations for constraint automata
Constraint automata (CA) constitute a coordination model based on finite
automata on infinite words. Originally introduced for modeling of coordinators,
an interesting new application of CAs is implementing coordinators (i.e.,
compiling CAs into executable code). Such an approach guarantees
correctness-by-construction and can even yield code that outperforms
hand-crafted code. The extent to which these two potential advantages
materialize depends on the smartness of CA-compilers and the existence of
proofs of their correctness.
Every transition in a CA is labeled by a "data constraint" that specifies an
atomic data-flow between coordinated processes as a first-order formula. At
run-time, compiler-generated code must handle data constraints as efficiently
as possible. In this paper, we present, and prove the correctness of two
optimization techniques for CA-compilers related to handling of data
constraints: a reduction to eliminate redundant variables and a translation
from (declarative) data constraints to (imperative) data commands expressed in
a small sequential language. Through experiments, we show that these
optimization techniques can have a positive impact on performance of generated
executable code
Iterative Delegations in Liquid Democracy with Restricted Preferences
In this paper, we study liquid democracy, a collective decision making
paradigm which lies between direct and representative democracy. One main
feature of liquid democracy is that voters can delegate their votes in a
transitive manner so that: A delegates to B and B delegates to C leads to A
delegates to C. Unfortunately, this process may not converge as there may not
even exist a stable state (also called equilibrium). In this paper, we
investigate the stability of the delegation process in liquid democracy when
voters have restricted types of preference on the agent representing them
(e.g., single-peaked preferences). We show that various natural structures of
preferences guarantee the existence of an equilibrium and we obtain both
tractability and hardness results for the problem of computing several
equilibria with some desirable properties
Polynomial Kernel for Immersion Hitting in Tournaments
For a fixed simple digraph H without isolated vertices, we consider the problem of deleting arcs from a given tournament to get a digraph which does not contain H as an immersion. We prove that for every H, this problem admits a polynomial kernel when parameterized by the number of deleted arcs. The degree of the bound on the kernel size depends on H
- …