64 research outputs found
Polynomial Delay Algorithm for Listing Minimal Edge Dominating sets in Graphs
The Transversal problem, i.e, the enumeration of all the minimal transversals
of a hypergraph in output-polynomial time, i.e, in time polynomial in its size
and the cumulated size of all its minimal transversals, is a fifty years old
open problem, and up to now there are few examples of hypergraph classes where
the problem is solved. A minimal dominating set in a graph is a subset of its
vertex set that has a non empty intersection with the closed neighborhood of
every vertex. It is proved in [M. M. Kant\'e, V. Limouzy, A. Mary, L. Nourine,
On the Enumeration of Minimal Dominating Sets and Related Notions, In Revision
2014] that the enumeration of minimal dominating sets in graphs and the
enumeration of minimal transversals in hypergraphs are two equivalent problems.
Hoping this equivalence can help to get new insights in the Transversal
problem, it is natural to look inside graph classes. It is proved independently
and with different techniques in [Golovach et al. - ICALP 2013] and [Kant\'e et
al. - ISAAC 2012] that minimal edge dominating sets in graphs (i.e, minimal
dominating sets in line graphs) can be enumerated in incremental
output-polynomial time. We provide the first polynomial delay and polynomial
space algorithm that lists all the minimal edge dominating sets in graphs,
answering an open problem of [Golovach et al. - ICALP 2013]. Besides the
result, we hope the used techniques that are a mix of a modification of the
well-known Berge's algorithm and a strong use of the structure of line graphs,
are of great interest and could be used to get new output-polynomial time
algorithms.Comment: proofs simplified from previous version, 12 pages, 2 figure
Luminescent hyperbolic metasurfaces.
When engineered on scales much smaller than the operating wavelength, metal-semiconductor nanostructures exhibit properties unobtainable in nature. Namely, a uniaxial optical metamaterial described by a hyperbolic dispersion relation can simultaneously behave as a reflective metal and an absorptive or emissive semiconductor for electromagnetic waves with orthogonal linear polarization states. Using an unconventional multilayer architecture, we demonstrate luminescent hyperbolic metasurfaces, wherein distributed semiconducting quantum wells display extreme absorption and emission polarization anisotropy. Through normally incident micro-photoluminescence measurements, we observe absorption anisotropies greater than a factor of 10 and degree-of-linear polarization of emission >0.9. We observe the modification of emission spectra and, by incorporating wavelength-scale gratings, show a controlled reduction of polarization anisotropy. We verify hyperbolic dispersion with numerical simulations that model the metasurface as a composite nanoscale structure and according to the effective medium approximation. Finally, we experimentally demonstrate >350% emission intensity enhancement relative to the bare semiconducting quantum wells
A rare case of anatomical variation of the femoral artery and vein
During a dissection of the two femoral trigons in a female corpse, about 14 years old, we discovered on the right side, the deep artery of the thigh arising from the medial side of the femoral artery and passed in front of the femoral vein above the mouth of the great saphenous vein; on both sides, there was the presence of a collateral canal which communicated the external iliac vein with the femoral vein on the right, on the left, it communicated the external iliac vein with the quadricipital vein. The lower part of the femoral vein was duplicated on both sides, but on the right, there was an interconnecting channel between the two trunks of the duplication. Variations of the femoral vessels are very frequent and can be responsible for an incident during the practice of certain gestures at the level of the femoral trigon such as: catheterization of the femoral artery or vein, the treatment of femoral hernias.
Key words: Deep thigh artery, collateral venous canal, external iliac vein, anatomic variations
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
Cliquewidth and knowledge compilation
In this paper we study the role of cliquewidth in succinct representation of Boolean functions. Our main statement is the following: Let Z be a Boolean circuit having cliquewidth k. Then there is another circuit Z * computing the same function as Z having treewidth at most 18k + 2 and which has at most 4|Z| gates where |Z| is the number of gates of Z. In this sense, cliquewidth is not more ‘powerful’ than treewidth for the purpose of representation of Boolean functions. We believe this is quite a surprising fact because it contrasts the situation with graphs where an upper bound on the treewidth implies an upper bound on the cliquewidth but not vice versa.
We demonstrate the usefulness of the new theorem for knowledge compilation. In particular, we show that a circuit Z of cliquewidth k can be compiled into a Decomposable Negation Normal Form (dnnf) of size O(918k k 2|Z|) and the same runtime. To the best of our knowledge, this is the first result on efficient knowledge compilation parameterized by cliquewidth of a Boolean circuit
Convexity in partial cubes: the hull number
We prove that the combinatorial optimization problem of determining the hull
number of a partial cube is NP-complete. This makes partial cubes the minimal
graph class for which NP-completeness of this problem is known and improves
some earlier results in the literature.
On the other hand we provide a polynomial-time algorithm to determine the
hull number of planar partial cube quadrangulations.
Instances of the hull number problem for partial cubes described include
poset dimension and hitting sets for interiors of curves in the plane.
To obtain the above results, we investigate convexity in partial cubes and
characterize these graphs in terms of their lattice of convex subgraphs,
improving a theorem of Handa. Furthermore we provide a topological
representation theorem for planar partial cubes, generalizing a result of
Fukuda and Handa about rank three oriented matroids.Comment: 19 pages, 4 figure
How Mistimed and Unwanted Pregnancies Affect Timing of Antenatal Care Initiation in three Districts in Tanzania
Early antenatal care (ANC) initiation is a doorway to early detection and management of potential complications associated with pregnancy. Although the literature reports various factors associated with ANC initiation such as parity and age, pregnancy intentions is yet to be recognized as a possible predictor of timing of ANC initiation. Data originate from a cross-sectional household survey on health behaviour and service utilization patterns. The survey was conducted in 2011 in Rufiji, Kilombero and Ulanga districts in Tanzania on 910 women of reproductive age who had given birth in the past two years. ANC initiation was considered to be early only if it occurred in the first trimester of pregnancy gestation. A recently completed pregnancy was defined as mistimed if a woman wanted it later, and if she did not want it at all the pregnancy was termed as unwanted. Chisquare was used to test for associations and multinomial logistic regression was conducted to examine how mistimed and unwanted pregnancies affect timing of ANC initiation. Although 49.3% of the women intended to become pregnant, 50.7% (34.9% mistimed and 15.8% unwanted) became pregnant unintentionally. While ANC initiation in the 1st trimester was 18.5%, so was 71.7% and 9.9% in the 2nd and 3rd trimesters respectively. Multivariate analysis revealed that ANC initiation in the 2nd trimester was 1.68 (95% CI 1.10‒2.58) and 2.00 (95% CI 1.05‒3.82) times more likely for mistimed and unwanted pregnancies respectively compared to intended pregnancies. These estimates rose to 2.81 (95% CI 1.41‒5.59) and 4.10 (95% CI 1.68‒10.00) respectively in the 3rd trimester. We controlled for gravidity, age, education, household wealth, marital status, religion, district of residence and travel time to a health facility. Late ANC initiation is a significant maternal and child health consequence of mistimed and unwanted pregnancies in Tanzania. Women should be empowered to delay or avoid pregnancies whenever they need to do so. Appropriate counseling to women, especially those who happen to conceive unintentionally is needed to minimize the possibility of delaying ANC initiation.\u
Extension of Some Edge Graph Problems: Standard and Parameterized Complexity
Le PDF est une version auteur non publiée.We consider extension variants of some edge optimization problems in graphs containing the classical Edge Cover, Matching, and Edge Dominating Set problems. Given a graph G=(V,E) and an edge set U⊆E, it is asked whether there exists an inclusion-wise minimal (resp., maximal) feasible solution E′ which satisfies a given property, for instance, being an edge dominating set (resp., a matching) and containing the forced edge set U (resp., avoiding any edges from the forbidden edge set E∖U). We present hardness results for these problems, for restricted instances such as bipartite or planar graphs. We counter-balance these negative results with parameterized complexity results. We also consider the price of extension, a natural optimization problem variant of extension problems, leading to some approximation results
- …