5100 search results - page 94 / 1020 » The Linear Complexity of a Graph |
COCOON
2003
Springer
14 years 2 months 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...
CHI
2010
ACM
14 years 4 months ago
2010
ACM
Network visualisations use clustering approaches to simplify the presentation of complex graph structures. We present a novel application of clustering algorithms, which controls ...
COCOON
2003
Springer
14 years 2 months ago
2003
Springer
In this paper, we approach the quality of a greedy algorithm for the maximum weighted clique problem from the viewpoint of matroid theory. More precisely, we consider the clique c...
IWPEC
2004
Springer
14 years 2 months ago
2004
Springer
Let G = V; E be a graph. The linear-width of G is de ned as the smallest integer k such that E can be arranged in a linear ordering e1; : : : ; er such that for every i = 1; :...
WG
2007
Springer
14 years 3 months ago
2007
Springer
A circular-arc model M = (C, A) is a circle C together with a collection A of arcs of C. If no arc is contained in any other then M is a proper circular-arc model, if every arc has...