[PDF] Top 20 Bipartite spanning sub(di)graphs induced by 2-partitions
Has 10000 "Bipartite spanning sub(di)graphs induced by 2-partitions" found on our website. Below are the top 20 most common "Bipartite spanning sub(di)graphs induced by 2-partitions".
Bipartite spanning sub(di)graphs induced by 2-partitions
... a 2-partition (V 1 , V 2 ) such that DhV i i is eulerian and non empty for i ∈ {1, 2} ? Corollary 21 asserts that we can decide in polynomial time whether a strong digraph has a (δ + ≥ 1, δ − ≥ ... Voir le document complet
18
A Fast Algorithm for Large Common Connected Induced Subgraphs
... and induced subgraphs (mccis) [ 8 , 16 , 17 ]: the latter means that all edges of G between nodes in the mcs are mapped to edges of H, and vice ...common subgraphs are very often confused with mcs’s, ... Voir le document complet
14
Complexity of inheritance of F-convexity for restricted games induced by minimum partitions
... weight spanning tree T in G and to verify path condition for the paths joining the end vertices of T and to test intermediary cycle condition for the fundamental cycles of T ...e 2 of ... Voir le document complet
29
Decomposing degenerate graphs into locally irregular subgraphs
... irregular subgraphs Throughout this paper, for a graph G and a given subset F ⊆ E(G) ...denote by G[F ] (resp., G[X]) the subgraph of G induced by F ... Voir le document complet
16
Organisation bipartite de la lymphopoïèse humaine
... organisation bipartite, articulée autour de l’existence de deux familles de progéniteurs lymphoïdes identifiées par l’expression différentielle du récepteur de l’interleukine 7 ... Voir le document complet
6
Mining Frequent Subgraphs in Multigraphs
... dataset by setting a frequency threshold = 2, the existing FSM approaches output no patterns, since they treat a set of relations between a pair of nodes as a unique identifier, rather than treating it as a ... Voir le document complet
28
Cataloguer les partitions
... Fiche pratique Cataloguer les partitions 1. Enjeux et définitions Le domaine de l'édition musicale a une forte dimension internationale. Il est donc particulièrement important de normaliser la description ... Voir le document complet
2
On Subgraphs of Bounded Degeneracy in Hypergraphs
... and d H (v) denotes the degree of ver- tex v in the hypergraph H. This connects, extends, and generalizes results of Alon-Kahn-Seymour (Graphs and Combinatorics, 1987), on d-degenerate sets of graphs, ... Voir le document complet
18
On Subgraphs of Bounded Degeneracy in Hypergraphs
... v in the hypergraph H. This extends and generalizes a result of Alon- Kahn-Seymour (Graphs and Combinatorics, 1987) for graphs, as well as a result of Dutta-Mubayi-Subramanian (SIAM Journal on Discrete Math- ematics, ... Voir le document complet
13
Colitis induced by proteinase-activated receptor-2 agonists is mediated by a neurogenic mechanism
... Version preprint Comment citer ce document : Nguyen, C., Coelho, A.-M., Grady, E., Compton, S. J., Wallace , J. L., Hollenberg, M. D., Cenac, N., Garcia Villar, R., Bueno, L., Steinhoff, M., Bunnett, N. W., Vergnolle, ... Voir le document complet
19
Finding good 2-partitions of digraphs II. Enumerable properties
... • R(F ) contains two disjoint directed cycles R 1 , R 2 , each of which intersects all the sets W 1 , . . . , W m if and only if F is a ‘Yes’-instance of NAE-3-SAT. 4.3 The reductions In our proofs we shall use ... Voir le document complet
25
Finding good 2-partitions of digraphs I. Hereditary properties
... are bipartite graphs (those having has a 2-partition into two independent sets) and split graphs (those having a 2-partition into a clique and an independent set) ...is bipartite, ... Voir le document complet
14
Penetration of fire partitions by plastic DWV pipe
... After 45 min, a red hot region (probably the furnace) was visible to observers looking down the axis of the pipe. The furnace was shut off after 47 min, and a minute later t[r] ... Voir le document complet
14
Acyclic Subgraphs of Planar Digraphs
... an induced forest of size 2n/5, where n denotes the number of vertices of the ...an induced forest of size at least n/2, which would imply that every oriented planar graph has an acyclic set of size ... Voir le document complet
10
On Spanning Galaxies in Digraphs
... the Spanning Galaxy problem of deciding whether a digraph D has a spanning galaxy or ...the Spanning Galaxy problem is equiva- lent to the problem of deciding if a strong digraph has a strong digraph ... Voir le document complet
22
Anomaly Ranking as Supervised Bipartite Ranking
... 4 by means of numerical experiments, based on un- labeled synthetic/real ...output by the 1- class SVM procedure can be used as a scoring function, improperly however because the objective function it op- ... Voir le document complet
10
Un format de partitions interactives
... des partitions numériques interactives à des documents multimédias interactifs, la spécificité des partitions musicales et les modes d’interaction avec elles méritent que l’on s’attache à produire un ... Voir le document complet
17
Intermittent hypoxia-induced delayed cardioprotection is mediated by PKC and triggered by p38 MAP kinase and Erk1/2.
... O 2 and 5% CO 2 and maintained at 37 °C and pH ...measured by a thermoprobe inserted into the left atrium and was maintained constant at ...was induced by stopping the perfusion for 30 ... Voir le document complet
34
Approximate Constrained Bipartite Edge Coloring
... 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
16
Recognizing Chordal-Bipartite Probe Graphs
... To find a cycle violating Rule 1, for each P P edge e, compute the minimal separators (called the substars of e) in the neighborhood of e (which costs O(m) per P P edge, as explained in [1]); e is on a chordless cycle of ... Voir le document complet
16
Sujets connexes