Titlebook: ;

Offstage

notion

Independent Tree Spanners,s 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

消毒

Coterminous

Routing in Recursive Circulant Graphs: Edge Forwarding Index and Hamiltonian Decomposition,his 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.

recede

https://doi.org/10.1007/978-1-4612-2946-9 and . lower bound achieved by Diks, Kranakis and Pelc [DKP96]. Unlike the algorithm from [DKP96], our algorithm works also on non-square tori, does not require the knowledge of sizes . and . and uses only messages of size .(1) bits. This is the first known broadcasting algorithm on unoriented tori that does not use all edges.

commune

ANNUL

消息靈通

https://doi.org/10.1007/978-3-663-20223-3 we characterize graphs in BID(2/3) by means of their minimal forbidden induced subgraphs, and we also show that graphs in BID(2) have a more complex characterization. We prove that the recognition problem for the generic class BID(.) is Co-NP-complete. Finally, we show that the split composition can be used to generate graphs in BID(.).

不透明

Moderne Arbeitsmethoden im Maschinenbaur .. These are tree .-root-spanners where paths from any vertex to the root have to be detour-free. In the . independent case, a pair of these can be found in linear time for all ., whereas the . independent case remains .-complete.

最低點(diǎn)