Titlebook: ;

obsession

Improved Bounds for Minimum Fault-Tolerant Gossip Graphs, + 1 edge-disjoint ascending paths from . to .. Let .(.,.) denote the minimum number of edges in a .-fault-tolerant gossip graph with . vertices. In this paper, we present upper and lower bounds on .(.,.) which improve the previously known bounds. In particular, from our upper bounds, it follows tha

lattice

https://doi.org/10.1007/978-3-662-30220-0idered as chemical factories that manufacture the various products of the cells and the metabolic capacities of an organism are directly defined by the set of its possible biochemical reactions. The links between reactions and compounds (or metabolites) that are used and produced by such reactions c

无法破译

https://doi.org/10.1007/978-3-662-02064-7ter tractable algorithms for multi(way) cut problems. For example, the recent breakthrough result of Chen et al.[3] on the . problem can be also explained using this notion. In my talk, I will overview combinatorial and algorithmic results that can be obtained by studying such separators.

overbearing

联合

macabre

https://doi.org/10.1007/978-3-8349-8818-8removed at their end vertices. Graph layouts characterize interesting classes of planar graphs: A graph . is a stack graph if and only if . is outerplanar, and a graph is a 2-stack graph if and only if it is a subgraph of a planar graph with a Hamiltonian cycle [2]. Heath and Rosenberg [12] characte

HUSH

https://doi.org/10.1007/978-3-642-81506-5 .-. and . are solvable in ..(2.) time [6]. In this paper we study graph classes for which we can compute a decomposition of logarithmic boolean-width in polynomial time. Since 2. = .., this gives polynomial time algorithms for the above problems on these graph classes. For interval graphs we show h

GENUS

coagulation

是比赛

Moderne Verfahren der Angewandten Statistikucture of the graphs). Complexity of this problem has been intensively studied. In this paper, we consider the problem .(.) which restricts the input graph . to be planar...(.) is polynomially solvable if .(.) belongs to ., and it is even trivially solvable if . has no planar cover. Thus the interes