[PDF] Top 20 Decomposition of graphs: some polynomial cases
Has 10000 "Decomposition of graphs: some polynomial cases" found on our website. Below are the top 20 most common "Decomposition of graphs: some polynomial cases".
Decomposition of graphs: some polynomial cases
... problem of decomposing the vertex set V of a graph into two parts (V 1 , V 2 ) which induce subgraphs where each vertex v in V 1 has degree at least a(v) and each vertex v in V 2 has degree at least ... Voir le document complet
11
Cases where finding the minimum entropy coloring of a characteristic graph is a polynomial time problem
... function of sources ...colorings of characteristic ...colorings of their characteristic graphs G X1 and G X2 (or, similarly the minimum entropy colorings of G n X 1 and G n X 2 , for ... Voir le document complet
6
Linear Rank-Width of Distance-Hereditary Graphs I. A Polynomial-Time Algorithm
... characterization of the linear rank- width of distance-hereditary graphs in terms of their canonical split decom- ...characterization of the path-width of forests given by Ellis, ... Voir le document complet
31
Polynomial Delay Algorithm for Listing Minimal Edge Dominating Sets in Graphs
... D of its set of vertices such that each vertex is either in D or has a neighbor in ...variant of the Minimum Dominating Set problem ...F of the edge set such that each edge is in F or is ... Voir le document complet
12
Decomposition of terminology graphs for domain knowledge acquisition.
... “Correlation function” is ranked 3rd by betweenness cen- trality. This cluster shares an indirect link with “central galaxy” via “dark matter halo”. Expert evaluation confirmed that this term is in some ... Voir le document complet
3
Multihomogeneous Polynomial Decomposition using Moment Matrices
... a decomposition besides the case of matrices or quadratic forms which may go back to the Babylonians, is due to Sylvester for binary forms ...kernels of catalecticant matrices are com- puted degree ... Voir le document complet
9
Contraction decomposition in h-minor-free graphs and algorithmic applications
... to graphs excluding a fixed graph H as a minor, ...minor-free graphs. The seminal Robertson–Seymour Graph Minor decomposition theorem [32] states that all such graphs are clique- sums ... Voir le document complet
11
Fully polynomial FPT algorithms for some classes of bounded clique-width graphs
... for some computable function f that only depends on k [31]. Some of the problems considered in this work can be expressed as an M SO 1 ...study of graphs problems in ...complexity ... Voir le document complet
61
Fully polynomial FPT algorithms for some classes of bounded clique-width graphs
... split decomposition. In partic- ular, suppose we partition the vertex-set of a graph G into modules, and then we keep exactly one vertex per ...most of the distance properties of ...modular ... Voir le document complet
21
Shared Risk Resource Groups and Colored Graph: Polynomial Cases and Transformation Issues
... Motivations of the paper The aforesaid optimization problems related to multilayer network survivability are momentous in the future development of such networks and they have to be solved ...still ... Voir le document complet
18
Kriging-sparse Polynomial Dimensional Decomposition surrogate model with adaptive refinement
... convergence of the second order indices is more difficult for the Monte Carlo based computations, especially when they have really small (or null) ...characteristic of the Monte Carlo computation of ... Voir le document complet
51
Non-standard limits of graphs and some orbit equivalence invariants
... ) of sequences of such objects. The use of a non principal ultrafilter u has the advan- tage of ensuring convergence and the existence of limit objects, strongly related to more ... Voir le document complet
59
Study of Identifying Code Polyhedra for Some Families of Split Graphs
... these cases. Our goal is to find a general construction of this type for all n ≥ ...point of view, even for special graphs like split graphs ...families of split graphs ... Voir le document complet
13
Some Applications of Decomposition Techniques to Systems of Coupled Variational Inequalities
... Unité de recherche INRIA Lorraine, Technopôle de Nancy-Brabois, Campus scientifique, 615 rue du Jardin Botanique, BP 101, 54600 VILLERS LÈS NANCY Unité de recherche INRIA Rennes, Irisa, [r] ... Voir le document complet
41
Some inverse scattering problems on star-shaped graphs
... knowledge of the Neumann reflection coefficient R N (k) determines uniquely the parameters (n j ) m j=1 and (l j ) m j=1 ...problem of identifying the geometry of a graph through the knowl- edge ... Voir le document complet
30
Selective Graph Coloring in Some Special Classes of Graphs
... vertices of V − V ′ and all edges incident to at least one vertex of V − V ′ ...V of pairwise non- adjacent vertices. The maximum size of a stable set in a graph G is called the stability ... Voir le document complet
12
On some simplicial elimination schemes for chordal graphs
... one of its unitary interval ...right(x)] of length one of the real line, su h that xy is an edge i I(x) ∩ I(y) 6= ∅ ...τ of the verti es of G de ned as follows: x ≤ τ y i (right(x) ... Voir le document complet
9
A polynomial time algorithm for determining the isomorphism of graphs of fixed genus
... L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignemen[r] ... Voir le document complet
12
Quantum Birkhoff–Gustavson normal form in some completely resonant cases
... mations of the real hyperbolic type, microlocally near the fixed point of the ...many of the ...structure of eigenvalue clusters are ... Voir le document complet
8
Some properties of edge intersection graphs of single-bend paths on a grid
... University of Warwick (DIMAP Center) and a visiting research fellow at the University of Haifa (Caesarea Rothschild ...support of these institutions is gratefully ... Voir le document complet
14
Sujets connexes