37 search results - page 5 / 8 » On connectivity of consecutive-d digraphs |
TCS
1998
13 years 7 months ago
1998
Recently a class of scalable multi-star optical networks is proposed in [2]. In this class of networks nodes are grouped into clusters. Each cluster employs a separate pair of bro...
IEEEARES
2006
IEEE
14 years 1 months ago
2006
IEEE
There is an increasing demand for highly reliable systems in the safety conscious climate of today’s world. When a fault does occur there are two desirable outcomes. Firstly, de...
MFCS
2004
Springer
14 years 26 days ago
2004
Springer
Let G = (V, E) be a (directed) graph with vertex set V and edge (arc) set E. Given a set P of (source-sink) pairs of vertices of G, an important problem that arises in the computat...
COCOON
2003
Springer
14 years 22 days ago
2003
Springer
Abstract. We show that finding roots of Boolean matrices is an NPhard problem. This answers a twenty year old question from semigroup theory. Interpreting Boolean matrices as dire...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
The Directed Maximum Leaf Out-Branching problem is to find an out-branching (i.e. a rooted oriented spanning tree) in a given digraph with the maximum number of leaves. In this pap...