We discuss two flexibility metrics for Simple Temporal Networks (STNs): the so-called naive flexibility metric based on the difference between earliest and latest starting times of temporal variables, and a recently proposed concurrent flexibility metric. We establish an interesting connection between the computation of these flexibility metrics and properties of the minimal distance matrix DS ...

A 2k-dicycle is a 2k-cycle of a directed bipartite graph and a 2k-dicycle system of order (m,n) is a triple (X, Y,D), where D is a collection of edge disjoint 2k-dicycles which partitions the edge set of the complete directed bipartite graph Dm,n with parts X and Y . A partial 2k-dicycle system of order (s, t) is a triple (S, T, P ), where P is a collection of edge disjoint 2k-dicycles of Ds,t ...

Let G be a graph and Ds Dt two dominating sets of size k. Does there exist sequence 〈D0=Ds,D1,…,Dℓ−1,Dℓ=Dt〉 such that Di+1 can obtained from Di by replacing one vertex with its neighbors? In this paper, we investigate the complexity decision problem. We first prove problem is PSPACE-complete, even when restricted to split, bipartite or bounded treewidth graphs. On other hand, it solved in polyn...

This paper analyzes the theoretical under­ pinnings of recent proposals for computing Dempster-Shafer Belief functions from ATMS labels. Such proposals are intended to be a means of integrating symbolic and numeric rep­ resentation methods and of focusing search in the ATMS. This synthesis is formalized us­ ing graph theory, thus showing the relation­ ship between graph theory, the logic-theore...

Let S be a double occurrence word, and let MS be the word’s interlacement matrix, regarded as a matrix over GF (2). Gauss addressed the question of which double occurrence words are realizable by generic closed curves in the plane. We reformulate answers given by Rosenstiehl and by de Fraysseix and Ossona de Mendez to give new graph-theoretic and algebraic characterizations of realizable words....

We suppose that S is a smooth hypersurface in Rn+1 with Gaussian curvature re and surface measure dS, it) is a compactly supported cut-off function, and we let pa be the surface measure with dßa = u>Ka dS. In this paper we consider the case where S is the graph of a suitably convex function, homogeneous of degree d, and estimate the Fourier transform ßa. We also show that if S is convex, with n...

This paper proposes a graph based strategy to retrieve frames containing the queried speakers in talk show videos. Based on who is speaking and when information from the audio transcript, an initial audio-based step, that restricts the queried person to frames corresponding to when he/she is speaking, with a second step that analyzes visual features of shots is combined. Specifically, based on ...

We study approximation solutions for the densest k-subgraph problem (DS-k) on several classes of intersection graphs. We adopt the concept of σ-quasi elimination orders, introduced by Akcoglu et al. [?], generalizing the perfect elimination orders for chordal graphs, and develop a simple O(σ)-approximation technique for graphs admitting such a vertex order. This concept allows us to derive cons...