4171 search results - page 224 / 835 » Choice numbers of graphs |
144
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...
135
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...
153
click to vote
FEGC
2009
15 years 4 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 ...
186
click to vote
JGT
2011
15 years 1 months ago
2011
Let G and H be two graphs of order n. If we place copies of G and H on a common vertex set, how much or little can they be made to overlap? The aim of this paper is to provide som...
201
click to vote
SPAA
2004
ACM
16 years 3 days ago
2004
ACM
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...