Ara es mostren els items 1-4 de 4

• #### Connected and internal graph searching ﻿

(2002-07)
Report de recerca
Accés obert
This paper is concerned with the graph searching game. The search number es(G) of a graph G is the smallest number of searchers required to clear G. A search strategy is monotone (m) if no recontamination ever occurs. It ...
• #### Connected graph searching ﻿

(2010-09-26)
Report de recerca
Accés obert
In graph searching game the opponents are a set of searchers and a fugitive in a graph. The searchers try to capture the fugitive by applying some sequence moves that include placement, removal, or sliding of a searcher ...
• #### Minimal contention-free matrices with application to multicasting ﻿

(2000)
Article
Accés obert
In this paper, we show that the multicast problem in trees can be expressed in term of arranging rows and columns of boolean matrices. Given a $p \times q$ matrix $M$ with 0-1 entries, the {\em shadow} of $M$ is ...
• #### The price of connectedness in expansions ﻿

(2004-05)
Report de recerca
Accés obert
Expansion is the way of generalizing different graph layout and searching problems. We initiate the study of connected expansion which naturally arises in a number of applications. Our main tool for this investigation ...