graph decompositions
Tree-Representation of Set Families in Graph Decompositions and Efficient Algorithms
... At the same time, an original aspect of studying divide-and-conquer algorithms could come from the converse of what has just been said. Actually, it is a quite common fact that some algorithms, while theoretically ...
211
Impact of the distance choice on clustering gene expression data using graph decompositions
... complete graph with weighted edges (e). In (f), we present the graph with the chosen threshold of 2 - we keep all edges with a weight smaller than the ...the graph-decomposition, we obtain three ...
21
Minimum Size Tree-decompositions
... on graph decompositions is the bi-dimensionality theory that allowed the design of sub-exponential-time algorithms for many problems in the class of graphs excluding some fixed graph as a minor ...
7
Minimum Size Tree-Decompositions
... on graph decompositions is the bi-dimensionality theory that allowed the design of sub-exponential-time algo- rithms for many problems in the class of graphs excluding some fixed graph as a minor ...
5
Pursuit-evasion, decompositions and convexity on graphs
... the graph plus ...the graph after it has removed all its tokens from this vertex on a previous ...a graph if, and only if, k cops playing monotonously can capture the robber on the same ...some ...
208
From tree-decompositions to clique-width terms
... important graph complexity measures that oc- cur as parameters in many fixed-parameter tractable (FPT) algorithms [12, 14, 16, 17, ...of graph structure and, in particular, for the description of certain ...
36
Minimum Size Tree-Decompositions
... on graph decompositions is the bi-dimensionality theory that allowed the design of sub-exponential-time algo- rithms for many problems in the class of graphs excluding some fixed graph as a minor ...
34
Size-Constrained Tree Decompositions
... on graph decompositions is the bi-dimensionality theory that allowed the design of sub-exponential-time algorithms for many problems in the class of graphs excluding some fixed graph as a minor ...
24
Path decompositions of perturbed reflected Brownian motions
... path decompositions focus on two families of random times of a recurrent PRBM: first hitting times (Section 3 ), and times at which the PRBM reaches its past minimum (Section 4 ...
28
Constrained ear decompositions in graphs and digraphs
... a graph G is the symmetric digraph obtained from G by replacing each edge {u, v} by the two arcs uv and ...a graph G is equivalent to solve MSSS for its associated symmetric ...
20
Enumerating simplicial decompositions of surfaces with boundaries
... edge is counted twice if both sides are incident to the face). A map is triangular if every face has degree 3. More generally, given a set ∆ ⊂ {1, 2, 3, . . .}, a map is ∆-angular if the degree of any face belongs to ∆. ...
25
NOTES ON OPEN BOOK DECOMPOSITIONS FOR ENGEL STRUCTURES
... 1. I NTRODUCTION One particularly fruitful approach to the study of contact structures is the use of open book decompositions, that was introduced by E. Giroux [Gi2]. He showed that every cooriented contact ...
25
On minimal decompositions of low rank symmetric tensors
... Although this algebraic approach to Waring decompositions is very classical and it basically goes back to the work of J. J. Sylvester on binary forms, we use a new tool which we believe have potential for further ...
27
Image decompositions and transformations as peaks and wells
... a graph where nodes N and oriented edges or arrows E are weighted with positive ...The graph may be considered as a railway network, where the nodes are railway stations and the arrows are connections ...
11
Coupling finite elements and proper generalized decompositions
... understand that the solution of such one model is quite delicate because we should build-up a separated approximation of the solution in both subdomains assuring the appropriate transfer conditions across the interface ...
25
DECOMPOSITIONS ET ALGORITHMES PROXIMAUX POUR L'ANALYSE ET LE TRAITEMENT ITERATIF DES SIGNAUX
... • la derni`ere partie illustre la seconde par des applications en traitement du signal, entre autres, le sch´ema de d´ecomposition du signal u + v pour analyser la texture et la g´eom´et[r] ...
159
Graph properties of graph associahedra
... a graph G on 5 ...connected graph G on at most 4 vertices, any pair of short flips (even with the same root) is contained in a Hamiltonian cycle of F(G), we can ignore Condition ( A ) in the definition of ...
27
Graph theory
... thus needed in order to better bridge abstract space and concrete space. In the past decades, geographers have proved to be able to explain in detail the strategies of specific actors involved in building and expanding ...
15
Graph Aggregation
... for graph aggregation rules that are collectively rational with respect to graph properties meeting certain semantically defined ...a graph property that are sufficient for guaranteeing that the ...
30
Tensor Decompositions, State of the Art and Applications
... Abstract In this paper, we present a partial survey of the tools borrowed from tensor algebra, which have been utilized recently in Statistics and Signal Processing. It is shown why the decompositions well known ...
28