𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Hardness and algorithms for rainbow connection

✍ Scribed by Sourav Chakraborty; Eldar Fischer; Arie Matsliah; Raphael Yuster

Publisher
Springer US
Year
2009
Tongue
English
Weight
585 KB
Volume
21
Category
Article
ISSN
1382-6905

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Rainbow connection number and connected
Rainbow connection number and connected dominating sets
✍ L. Sunil Chandran; Anita Das; Deepak Rajendraprasad; Nithin M. Varma πŸ“‚ Article πŸ“… 2011 πŸ› John Wiley and Sons 🌐 English βš– 167 KB

## Abstract The __rainbow connection number__ of a connected graph is the minimum number of colors needed to color its edges, so that every pair of its vertices is connected by at least one path in which no two edges are colored the same. In this article we show that for every connected graph on __

Algorithms for the Gauss–Manin Connectio
Algorithms for the Gauss–Manin Connection
✍ Mathias Schulze πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 402 KB

We give an introduction to the theory of the Gauss-Manin connection of an isolated hypersurface singularity and describe an algorithm to compute the V-filtration on the Brieskorn lattice. We use an implementation in the computer algebra system Singular to prove C. Hertling's conjecture about the var

Connection caching: model and algorithms
Connection caching: model and algorithms
✍ Edith Cohen; Haim Kaplan; Uri Zwick πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 380 KB

We introduce a theoretical model for connection caching. In our model each host maintains (caches) a limited number of open connections to other hosts. A request may utilize an open connection in which case it is a hit, or it may require to open a new connection in which case it is a miss. Establish