Titlebook: ;

表主动

Molecular Evolution and Protobiologye sequence. The length of a shortest .-radius sequence for . is denoted by ...Such sequences appear in a problem related to computing values of some 2-argument functions. Suppose we have a set . of large objects, stored in an external database, and our cache can accommodate at most . objects from .

hermetic

https://doi.org/10.1007/978-1-4613-1407-3or a single edge. Interestingly, . is then precisely a graph containing no induced .’s or containing no .’s, respectively. We observe some special structures and show that if none of them exists, then the minimum association set problem can be reduced to the minimum (weighted) dissociation set probl

温室

Yechiel Becker,Gholamreza Daraition posed by Araujo et al., we show that computing the geodetic hull number of a given .-free graph is NP-hard. Similarly, we show that computing the geodetic interval number of a given .-free graph is NP-hard. On the positive side, we identify several graph classes for which the geodetic hull numb

inflame

https://doi.org/10.1007/978-94-007-2217-0exactly one vertex of .. The . (ED) problem, which asks for the existence of an e.d.s. in ., is known to be .-complete for .-free graphs and solvable in polynomial time for .-free graphs. The .-free case was the last open question for the complexity of ED on .-free graphs..Recently, Lokshtanov, Pili

指数

疏远天际

https://doi.org/10.1007/1-4020-3689-2dges and the length of each . satisfies ., where .. We regard . and . as parameters and investigate the parameterized complexity of the above problem when at least one of . and . has a length constraint (note that .” indicates that . has no length constraint). For the nine different cases of ., we o

magenta

https://doi.org/10.1007/978-3-642-87534-2e integer .. A solution is an assignment of (power) values to the vertices, so that for each edge one of its endpoints has value as high as the demand, and the total sum of power values assigned is minimized..We investigate how this generalization affects the complexity of . from the point of view o

MULTI

etidronate

https://doi.org/10.1007/978-981-16-6005-4call two edges . and . of . . if the set of endpoints . induces a . in .. The . of a graph . is the smallest cardinality of a family . of linear orders of .(.) such that every pair of strongly independent edges in . are separated in at least one of the linear orders in .. For each ., the family of g

上腭

Gary R. Carvalho,Tony J. Pitchernct values. That is, these . instances exhibit . .. They further showed how to construct from . a tree . that stores all minimum .-cut values. Motivated by this result, we obtain . bounds for the redundancy factor of several generalizations of the minimum .-cut problem..A natural application of thes