3204 search results - page 385 / 641 » The b-chromatic Number of a Graph |
155
click to vote
DAM
2002
15 years 6 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)
172
click to vote
IWC
2000
15 years 6 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...
147
click to vote
IPL
2002
15 years 6 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...
139
click to vote
COMBINATORICS
1999
15 years 6 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...
188
click to vote
ALGORITHMICA
1998
15 years 6 months ago
1998
Mallows and Riordan showed in 1968 that labeled trees with a small number of inversions are related to labeled graphs that are connected and sparse. Wright enumerated sparse connec...