3204 search results - page 119 / 641 » The Alcuin Number of a Graph |
DAM
2002
13 years 8 months ago
2002
For a positive integer k, a k-subdominating function of a graph G = (V; E) is a function f : V {-1; 1} such that uNG[v] f(u)
IWC
2000
13 years 8 months ago
2000
Information visualisation systems which generate diagrams representing discrete relational information must consider potential users if they are to be effective. Many algorithms w...
IPL
2002
13 years 7 months ago
2002
The barycenter heuristic is often used to solve the NP-hard two-layer edge crossing minimization problem. It is well-known that the barycenter heuristic can give solutions as bad a...
COMBINATORICS
1999
13 years 7 months ago
1999
An orthogonal coloring of a graph G is a pair {c1, c2} of proper colorings of G, having the property that if two vertices are colored with the same color in c1, then they must hav...
FEGC
2009
13 years 6 months ago
2009
We develop an efficient algorithm for detecting frequent patterns that occur in sequence databases under certain constraints. By combining the use of bit vector representations of ...