3471 search results - page 211 / 695 » Obstacle Numbers of Graphs |
133
Voted
IWC
2000
15 years 4 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...
120
Voted
IPL
2002
15 years 4 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...
102
click to vote
COMBINATORICS
1999
15 years 4 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...
125
click to vote
FEGC
2009
15 years 2 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 ...
148
Voted
JGT
2011
14 years 12 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...