176 search results - page 14 / 36 » On Directed Triangles in Digraphs |
COCOON
2003
Springer
14 years 18 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...
EJC
2008
13 years 7 months ago
2008
Partially ordered sets labeled with k labels (k-posets) and their homomorphisms are examined. The homomorphicity order of k-posets is shown to be a distributive lattice. Homomorph...
PAM
2009
Springer
14 years 2 months ago
2009
Springer
Triangle inequality violations (TIVs) are the effect of packets between two nodes being routed on the longer direct path between them when a shorter detour path through an intermed...
ICALP
2007
Springer
14 years 1 months ago
2007
Springer
d Abstract) Noga Alon∗ Fedor V. Fomin† Gregory Gutin‡ Michael Krivelevich§ Saket Saurabh¶ We prove that finding a rooted subtree with at least k leaves in a directed grap...
ECEASST
2006
13 years 7 months ago
2006
This paper contributes in two directions. First, several concepts of our matrix approach to graph transformation [1,2] such as coherence and minimal initial digraph are applied to ...