Mathematical Foundations of Computer Science 2006
31st International Symposium, MFCS 2006, Stará Lesná, Slovakia, August 28-September 1, 2006. Proceedings
Page
%P
24 Result(s)
within
Rastislav Královič
Algorithm Analysis and Problem Complexity
-
Chapter and Conference Paper
Rapid Almost-Complete Broadcasting in Faulty Networks
This paper studies the problem of broadcasting in synchronous point-to-point networks, where one initiator owns a piece of information that has to be transmitted to all other vertices as fast as possible. The ...
-
Book and Conference Proceedings
-
Chapter and Conference Paper
On Fractional Dynamic Faults with Threshold
Unlike localized communication failures that occur on a fixed (although a priori unknown) set of links, dynamic faults can occur on any link. Known also as mobile or ubiquitous faults, their presence makes many t...
-
Chapter and Conference Paper
On Semi-perfect 1-Factorizations
The perfect 1-factorization conjecture by A. Kotzig [7] asserts the existence of a 1-factorization of a complete graph K 2n in which any two 1-factors induce a Hamiltonian cycle. This conject...
