446 research outputs found
Graphs Identified by Logics with Counting
We classify graphs and, more generally, finite relational structures that are
identified by C2, that is, two-variable first-order logic with counting. Using
this classification, we show that it can be decided in almost linear time
whether a structure is identified by C2. Our classification implies that for
every graph identified by this logic, all vertex-colored versions of it are
also identified. A similar statement is true for finite relational structures.
We provide constructions that solve the inversion problem for finite
structures in linear time. This problem has previously been shown to be
polynomial time solvable by Martin Otto. For graphs, we conclude that every
C2-equivalence class contains a graph whose orbits are exactly the classes of
the C2-partition of its vertex set and which has a single automorphism
witnessing this fact.
For general k, we show that such statements are not true by providing
examples of graphs of size linear in k which are identified by C3 but for which
the orbit partition is strictly finer than the Ck-partition. We also provide
identified graphs which have vertex-colored versions that are not identified by
Ck.Comment: 33 pages, 8 Figure
Pulmonary Hypertension in Patients with Chronic Fibrosing Idiopathic Interstitial Pneumonias
Background Pulmonary hypertension (PH) is a common finding in patients with chronic fibrosing idiopathic interstitial pneumonias (IIP). Little is known about the response to pulmonary vasodilator therapy in this patient population. COMPERA is an international registry that prospectively captures data from patients with various forms of PH receiving pulmonary vasodilator therapies. Methods We retrieved data from COMPERA to compare patient characteristics, treatment patterns, response to therapy and survival in newly diagnosed patients with idiopathic pulmonary arterial hypertension (IPAH) and PH associated with IIP (PH-IIP). Results Compared to patients with IPAH (n = 798), patients with PH-IIP (n = 151) were older and predominantly males. Patients with PH-IIP were treated predominantly with phosphodiesterase-5 inhibitors (88% at entry, 87% after 1 year). From baseline to the first follow-up visit, the median improvement in 6MWD was 30 m in patients with IPAH and 24.5 m in patients with PH-IIP (p = 0.457 for the difference between both groups). Improvements in NYHA functional class were observed in 22.4% and 29.5% of these patients, respectively (p = 0.179 for the difference between both groups). Survival rates were significantly worse in PH-IIP than in IPAH (3-year survival 34.0 versus 68.6%; p<0.001). Total lung capacity, NYHA class IV, and mixed-venous oxygen saturation were independent predictors of survival in patients with PH-IIP. Conclusions Patients with PH-IIP have a dismal prognosis. Our results suggest that pulmonary vasodilator therapy may be associated with short-term functional improvement in some of these patients but it is unclear whether this treatment affects survival
Parameterized Directed -Chinese Postman Problem and Arc-Disjoint Cycles Problem on Euler Digraphs
In the Directed -Chinese Postman Problem (-DCPP), we are given a
connected weighted digraph and asked to find non-empty closed directed
walks covering all arcs of such that the total weight of the walks is
minimum. Gutin, Muciaccia and Yeo (Theor. Comput. Sci. 513 (2013) 124--128)
asked for the parameterized complexity of -DCPP when is the parameter.
We prove that the -DCPP is fixed-parameter tractable.
We also consider a related problem of finding arc-disjoint directed
cycles in an Euler digraph, parameterized by . Slivkins (ESA 2003) showed
that this problem is W[1]-hard for general digraphs. Generalizing another
result by Slivkins, we prove that the problem is fixed-parameter tractable for
Euler digraphs. The corresponding problem on vertex-disjoint cycles in Euler
digraphs remains W[1]-hard even for Euler digraphs
Reduction Techniques for Graph Isomorphism in the Context of Width Parameters
We study the parameterized complexity of the graph isomorphism problem when
parameterized by width parameters related to tree decompositions. We apply the
following technique to obtain fixed-parameter tractability for such parameters.
We first compute an isomorphism invariant set of potential bags for a
decomposition and then apply a restricted version of the Weisfeiler-Lehman
algorithm to solve isomorphism. With this we show fixed-parameter tractability
for several parameters and provide a unified explanation for various
isomorphism results concerned with parameters related to tree decompositions.
As a possibly first step towards intractability results for parameterized graph
isomorphism we develop an fpt Turing-reduction from strong tree width to the a
priori unrelated parameter maximum degree.Comment: 23 pages, 4 figure
Tractable Combinations of Global Constraints
We study the complexity of constraint satisfaction problems involving global
constraints, i.e., special-purpose constraints provided by a solver and
represented implicitly by a parametrised algorithm. Such constraints are widely
used; indeed, they are one of the key reasons for the success of constraint
programming in solving real-world problems.
Previous work has focused on the development of efficient propagators for
individual constraints. In this paper, we identify a new tractable class of
constraint problems involving global constraints of unbounded arity. To do so,
we combine structural restrictions with the observation that some important
types of global constraint do not distinguish between large classes of
equivalent solutions.Comment: To appear in proceedings of CP'13, LNCS 8124. arXiv admin note: text
overlap with arXiv:1307.179
Compact Labelings For Efficient First-Order Model-Checking
We consider graph properties that can be checked from labels, i.e., bit
sequences, of logarithmic length attached to vertices. We prove that there
exists such a labeling for checking a first-order formula with free set
variables in the graphs of every class that is \emph{nicely locally
cwd-decomposable}. This notion generalizes that of a \emph{nicely locally
tree-decomposable} class. The graphs of such classes can be covered by graphs
of bounded \emph{clique-width} with limited overlaps. We also consider such
labelings for \emph{bounded} first-order formulas on graph classes of
\emph{bounded expansion}. Some of these results are extended to counting
queries
Visual Ontology Cleaning: Cognitive Principles and Applicability
In this paper we connect two research areas, the Qualitative
Spatial Reasoning and visual reasoning on ontologies. We discuss the logical
limitations of the mereotopological approach to the visual ontology
cleaning, from the point of view of its formal support. The analysis is
based on three different spatial interpretations wich are based in turn on
three different spatial interpretations of the concepts of an ontology.Ministerio de Educación y Ciencia TIN2004-0388
The power of propagation:when GAC is enough
Considerable effort in constraint programming has focused on the development of efficient propagators for individual constraints. In this paper, we consider the combined power of such propagators when applied to collections of more than one constraint. In particular we identify classes of constraint problems where such propagators can decide the existence of a solution on their own, without the need for any additional search. Sporadic examples of such classes have previously been identified, including classes based on restricting the structure of the problem, restricting the constraint types, and some hybrid examples. However, there has previously been no unifying approach which characterises all of these classes: structural, language-based and hybrid. In this paper we develop such a unifying approach and embed all the known classes into a common framework. We then use this framework to identify a further class of problems that can be solved by propagation alone
- …