• Aucun résultat trouvé

Maximal independent set

en
                                                                    fr

en fr On maximal det-independent (res-independent) sets in graphs Sur les ensembles maximaux indépendants de det (res-indépendants) dans les graphiques

... a maximal independent set in a hereditary system is a minimal determin- ing (resolving) ...such maximal independent sets which are not necessarily determining (resolv- ing) ...a ...

6

Extension of Vertex Cover and Independent Set in Some Classes of Graphs

Extension of Vertex Cover and Independent Set in Some Classes of Graphs

... pendent Set. Given a graph G = (V, E) and a vertex set U ⊆ V , it is asked if there exists a minimal vertex cover ...(resp. maximal independent set) S with U ⊆ S ...

21

Fixed points in conjunctive networks and maximal independent sets in graph contractions

Fixed points in conjunctive networks and maximal independent sets in graph contractions

... of maximal independent sets in G and the maximum number of maximal independent sets among all the graphs obtained from G by contracting some ...point, maximal independent ...

29

Fast Algorithms for max independent set

Fast Algorithms for max independent set

... two recurrence relations with a better branching behaviour than we need to prove. We will continue by showing that we can always obtain a T 3 (k − 5) branch when taking v in I and discarding its neighbors. Removing N (v) ...

29

Maximal-Element Rationalizability

Maximal-Element Rationalizability

... main, and the decisiveness of choice. As a by-product of our analysis of maximal-element rationalizability, we shed further light on a problem left open in the classical study by Richter (1971) on ...

22

Maximal bifix decoding

Maximal bifix decoding

... exchange set is a tree set (Proposition ...tree set are tame, that is, obtained from the alphabet by composition of elementary positive automorphisms (Theorem ...

31

Maximal bifix decoding

Maximal bifix decoding

... ≥ 1 and the left-special words are the prefixes of the words f n (a) or f n (c) for n ≥ 1, as one may verify. Any right- special word w is such that r(w) = 3 and thus S is not an interval exchange set. There are ...

32

Definiteness as Maximal Informativeness

Definiteness as Maximal Informativeness

... is set up by these items seems to have the same behavior as numerals, which specify a lower bound only: (9) For sure Miranda has 3 children, but maybe she has ...

11

Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms

Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms

... max set packing, max clique and max bipartite subgraph We show in this section how the results obtained in previous sections can be applied also to ap- proximate other combinatorial ...max set packing, max ...

26

A relation between the approximated versions of minimum set covering, minimum vertex covering and maximum independent set

A relation between the approximated versions of minimum set covering, minimum vertex covering and maximum independent set

... (IS) is to find an independent set of maximum size. One of the most interesting theoretical problems in the complexity theory is to be able to “transfer” approximation results (positive, negative, or ...

12

Partitioning sparse graphs into an independent set and a graph with bounded size components

Partitioning sparse graphs into an independent set and a graph with bounded size components

... an independent set and a set that induces a graph whose components are paths of order at most ...vertex set and the edge set, respectively, of ...vertex set of a sparse graph G, ...

25

Regulatory Features Underlying Pollination-Dependent
and -Independent Tomato Fruit Set Revealed by Transcript
and Primary Metabolite Profiling

Regulatory Features Underlying Pollination-Dependent and -Independent Tomato Fruit Set Revealed by Transcript and Primary Metabolite Profiling

... of sucrose degradation since alterations of sucrose metabolism have often been correlated with changes in yield parameters (Lytovchenko et al., 2007). The combined data provide compel- ling evidence that photosynthesis ...

26

Improved FPT algorithms for weighted independent set in bull-free graphs

Improved FPT algorithms for weighted independent set in bull-free graphs

... an independent set of weight at least k? The above problem is well-known to be W [1]-hard in general graphs [7], and therefore an FPT algorithm is unlikely to exist (see [7, 9, 17] for the missing ...

15

The bifurcation measure has maximal entropy

The bifurcation measure has maximal entropy

... has maximal entropy in a very strong sense: it only sees sets of maximal entropy and by Theorem A, any compact set outside its support does not carry maximal ...

24

Extended geometry and gauged maximal supergravity

Extended geometry and gauged maximal supergravity

... we set the basic notation and ad- dress the definition of generalized diffeomorphisms on a 56 dimensional extended ...of maximal N = 8 supergravity and would naturally appear in Scherk-Schwarz like ...

45

The Gaugings of Maximal D=6 Supergravity

The Gaugings of Maximal D=6 Supergravity

... of maximal supergravity theories have revealed intriguing insights into the struc- ture of supergravity theories as well as into their higher dimensional origin and the possi- ble symmetry structures underlying ...

35

Appendix: Maximal power of heat machines

Appendix: Maximal power of heat machines

... 4 (reached for C 1 = C 2 ), of the heat flux C(T 1 − T 2 ) that would be transferred from S 1 to S 2 for a coefficient C equal to the average √ C 1 C 2 . Finally, the efficiency at maximal power is obtained from ...

3

On the selection of maximal Cheeger sets

On the selection of maximal Cheeger sets

... precise relationship between Cheeger sets and solutions of (1.3): u solves (1.3) if and only if all its level sets are Cheeger sets. We refer to Theorem 2 of [3] for a proof, the case f = g = 1 being well-known. Except ...

14

An algorithm for reporting maximal c-cliques

An algorithm for reporting maximal c-cliques

... reporting maximal c-cliques 5 ...the set of nodes which can at some stage be added to the growing cliques, whereas T is the set of already processed and hence forbidden ...

14

Convolutions of maximal monotone mappings

Convolutions of maximal monotone mappings

... Monotone maps, convolution, proximal maps, Yosida approximant, resolvent.. Classifications.[r] ...

50

Show all 1346 documents...

Sujets connexes