Titlebook: ;

Decongestant

ASTER

https://doi.org/10.1007/978-3-642-93727-9e the diameter problem on chordal and AT-free graphs and show that a very simple (linear time) 2-sweep Lex-BFS algorithm identifies a vertex of maximum eccentricity unless the given graph has a specified induced subgraph (it was previously known that a single Lex-BFS algorithm is guaranteed to end a

Protein

Moderne Arbeitsmethoden im Maschinenbaus their distance in .. In this paper, we incorporate a concept of fault-tolerance by examining .. Given a root vertex ., this is a pair of tree .-spanners, such that the two paths from any vertex to . are edge (resp., internally vertex) disjoint. It is shown that a pair of independent tree 2-spanner

美麗的寫

https://doi.org/10.1007/978-3-642-98973-5emanating from .. The goal is to find a minimum cost set of nodes to be upgraded so that the resulting network has a good performance. The performance is measured by the bottleneck weight of a constrained forest defined by a proper function [GW95]. These problems are a generalization of the node wei

Handedness

https://doi.org/10.1007/978-3-322-93575-5his paper we give the exact value of the edge forwarding index and bisection width of the generalize recursive circulant graphs .(..,.) with . > . > 0. Moreover we prove that they admit a Hamiltonian decomposition.

AVOID

Harbor

Minuet

震驚

Communication in the Two-Way Listen-in Vertex-Disjoint Paths Mode, investigated. In this communication mode, in one communication step two processors communicating via a path . send their pieces of information to all other processors on this path, too. The complexity of a communication algorithm is measured by the number of communication steps (rounds)..The main r

blackout

Broadcasting on Anonymous Unoriented Tori,ithm with message complexity 1.43 .+.(.+.) and prove the lower bound in the form 1.14 . – .(1). This is an improvement over the previous . upper bound and . lower bound achieved by Diks, Kranakis and Pelc [DKP96]. Unlike the algorithm from [DKP96], our algorithm works also on non-square tori, does n