191 search results - page 7 / 39 » Intersections of graphs |
JGT
2011
13 years 2 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...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
We present a linear time algorithm for the minimum linear arrangement problem on proper interval graphs. The obtained ordering is a 4-approximation for general interval graphs. 1 ...
MFCS
2007
Springer
14 years 1 months ago
2007
Springer
WG
2007
Springer
14 years 1 months ago
2007
Springer
SWAT
2004
Springer
14 years 24 days ago
2004
Springer